Base | Representation |
---|---|
bin | 100010001000010… |
… | …0110011100011111 |
3 | 2221210220022110001 |
4 | 1010100212130133 |
5 | 4321132434323 |
6 | 305345355131 |
7 | 40244026456 |
oct | 10420463437 |
9 | 2853808401 |
10 | 1145202463 |
11 | 538489619 |
12 | 27b638aa7 |
13 | 1533494c2 |
14 | ac147b9d |
15 | 6a8143ad |
hex | 4442671f |
1145202463 has 4 divisors (see below), whose sum is σ = 1145591928. Its totient is φ = 1144813000.
The previous prime is 1145202439. The next prime is 1145202491. The reversal of 1145202463 is 3642025411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3642025411 = 54617 ⋅66683.
It is a cyclic number.
It is not a de Polignac number, because 1145202463 - 229 = 608331551 is a prime.
It is a super-2 number, since 2×11452024632 = 2622977362522532738, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145202493) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 190288 + ... + 196213.
It is an arithmetic number, because the mean of its divisors is an integer number (286397982).
Almost surely, 21145202463 is an apocalyptic number.
1145202463 is a deficient number, since it is larger than the sum of its proper divisors (389465).
1145202463 is an equidigital number, since it uses as much as digits as its factorization.
1145202463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 389464.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 1145202463 is about 33840.8401639203. The cubic root of 1145202463 is about 1046.2306154308.
Adding to 1145202463 its reverse (3642025411), we get a palindrome (4787227874).
The spelling of 1145202463 in words is "one billion, one hundred forty-five million, two hundred two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •