Base | Representation |
---|---|
bin | 10011000001110000… |
… | …10010000011001011 |
3 | 222100220220002000110 |
4 | 21200320102003023 |
5 | 131410104120243 |
6 | 4405353205403 |
7 | 511100425413 |
oct | 114070220313 |
9 | 28326802013 |
10 | 10215301323 |
11 | 43722a9097 |
12 | 1b91100863 |
13 | c6a4a12c6 |
14 | 6cc9a9643 |
15 | 3ebc3ae33 |
hex | 260e120cb |
10215301323 has 16 divisors (see below), whose sum is σ = 13773828096. Its totient is φ = 6733916160.
The previous prime is 10215301289. The next prime is 10215301337. The reversal of 10215301323 is 32310351201.
It is not a de Polignac number, because 10215301323 - 29 = 10215300811 is a prime.
It is a super-2 number, since 2×102153013232 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10215301323.
It is not an unprimeable number, because it can be changed into a prime (10215301373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42315 + ... + 149067.
It is an arithmetic number, because the mean of its divisors is an integer number (860864256).
Almost surely, 210215301323 is an apocalyptic number.
10215301323 is a deficient number, since it is larger than the sum of its proper divisors (3558526773).
10215301323 is a wasteful number, since it uses less digits than its factorization.
10215301323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107114.
The product of its (nonzero) digits is 540, while the sum is 21.
Adding to 10215301323 its reverse (32310351201), we get a palindrome (42525652524).
The spelling of 10215301323 in words is "ten billion, two hundred fifteen million, three hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •