Base | Representation |
---|---|
bin | 10011011111011100… |
… | …11000101100001011 |
3 | 1000000021112211121001 |
4 | 21233232120230023 |
5 | 132412334142243 |
6 | 4450211355431 |
7 | 520213431466 |
oct | 115756305413 |
9 | 30007484531 |
10 | 10464365323 |
11 | 448a952605 |
12 | 20405b2b77 |
13 | ca9c76959 |
14 | 713ac02dd |
15 | 413a37a4d |
hex | 26fb98b0b |
10464365323 has 16 divisors (see below), whose sum is σ = 10607173632. Its totient is φ = 10322928000.
The previous prime is 10464365251. The next prime is 10464365333. The reversal of 10464365323 is 32356346401.
It is a cyclic number.
It is not a de Polignac number, because 10464365323 - 29 = 10464364811 is a prime.
It is a super-2 number, since 2×104643653232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10464365333) 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, 21312108 + ... + 21312598.
It is an arithmetic number, because the mean of its divisors is an integer number (662948352).
Almost surely, 210464365323 is an apocalyptic number.
10464365323 is a deficient number, since it is larger than the sum of its proper divisors (142808309).
10464365323 is a wasteful number, since it uses less digits than its factorization.
10464365323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1386.
The product of its (nonzero) digits is 155520, while the sum is 37.
The spelling of 10464365323 in words is "ten billion, four hundred sixty-four million, three hundred sixty-five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •