Base | Representation |
---|---|
bin | 1001011000111001011000… |
… | …0001100101111101011011 |
3 | 1100112220022011021101110020 |
4 | 2112032112001211331123 |
5 | 2323114131243143230 |
6 | 33542245211521523 |
7 | 2113556402116404 |
oct | 226162601457533 |
9 | 40486264241406 |
10 | 10323323412315 |
11 | 3320107a35191 |
12 | 11a88901592a3 |
13 | 59b640050704 |
14 | 279919aa89ab |
15 | 12d7eeee7810 |
hex | 96396065f5b |
10323323412315 has 16 divisors (see below), whose sum is σ = 16518138516000. Its totient is φ = 5505498801152.
The previous prime is 10323323412293. The next prime is 10323323412317. The reversal of 10323323412315 is 51321432332301.
It is a cyclic number.
It is not a de Polignac number, because 10323323412315 - 231 = 10321175928667 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10323323412317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16793340 + ... + 17397209.
It is an arithmetic number, because the mean of its divisors is an integer number (1032383657250).
Almost surely, 210323323412315 is an apocalyptic number.
10323323412315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10323323412315 is a deficient number, since it is larger than the sum of its proper divisors (6194815103685).
10323323412315 is a wasteful number, since it uses less digits than its factorization.
10323323412315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34210686.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 10323323412315 its reverse (51321432332301), we get a palindrome (61644755744616).
The spelling of 10323323412315 in words is "ten trillion, three hundred twenty-three billion, three hundred twenty-three million, four hundred twelve thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •