Base | Representation |
---|---|
bin | 10000110101000000110… |
… | …010111111110100001010 |
3 | 11002112221211022002202201 |
4 | 100311000302333310022 |
5 | 122421333412004114 |
6 | 2243131431150414 |
7 | 146356331654656 |
oct | 20650062776412 |
9 | 4075854262681 |
10 | 1156433313034 |
11 | 40649350337a |
12 | 16815b21540a |
13 | 8508861a2ac |
14 | 3dd8639da66 |
15 | 20135022874 |
hex | 10d40cbfd0a |
1156433313034 has 48 divisors (see below), whose sum is σ = 1878776000640. Its totient is φ = 531980042880.
The previous prime is 1156433313031. The next prime is 1156433313037. The reversal of 1156433313034 is 4303133346511.
It is an interprime number because it is at equal distance from previous prime (1156433313031) and next prime (1156433313037).
It is a junction number, because it is equal to n+sod(n) for n = 1156433312984 and 1156433313002.
It is not an unprimeable number, because it can be changed into a prime (1156433313031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19965087 + ... + 20022925.
It is an arithmetic number, because the mean of its divisors is an integer number (39141166680).
Almost surely, 21156433313034 is an apocalyptic number.
1156433313034 is a deficient number, since it is larger than the sum of its proper divisors (722342687606).
1156433313034 is a wasteful number, since it uses less digits than its factorization.
1156433313034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58123 (or 58056 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 37.
Adding to 1156433313034 its reverse (4303133346511), we get a palindrome (5459566659545).
The spelling of 1156433313034 in words is "one trillion, one hundred fifty-six billion, four hundred thirty-three million, three hundred thirteen thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •