Base | Representation |
---|---|
bin | 10011001110101001… |
… | …01100100110110111 |
3 | 222122110022201221121 |
4 | 21213110230212313 |
5 | 132120243212211 |
6 | 4424214324411 |
7 | 513552365152 |
oct | 114724544667 |
9 | 28573281847 |
10 | 10323413431 |
11 | 4418330341 |
12 | 2001359707 |
13 | c869c5276 |
14 | 6dd0acc99 |
15 | 406494271 |
hex | 26752c9b7 |
10323413431 has 16 divisors (see below), whose sum is σ = 11061388800. Its totient is φ = 9605217600.
The previous prime is 10323413389. The next prime is 10323413453. The reversal of 10323413431 is 13431432301.
It is a cyclic number.
It is not a de Polignac number, because 10323413431 - 211 = 10323411383 is a prime.
It is a super-2 number, since 2×103234134312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10323413396 and 10323413405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10323413461) 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 15 ways as a sum of consecutive naturals, for example, 1376211 + ... + 1383691.
It is an arithmetic number, because the mean of its divisors is an integer number (691336800).
Almost surely, 210323413431 is an apocalyptic number.
10323413431 is a deficient number, since it is larger than the sum of its proper divisors (737975369).
10323413431 is a wasteful number, since it uses less digits than its factorization.
10323413431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8790.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10323413431 its reverse (13431432301), we get a palindrome (23754845732).
The spelling of 10323413431 in words is "ten billion, three hundred twenty-three million, four hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •