Base | Representation |
---|---|
bin | 1010100011100000100100… |
… | …10010000110001010101011 |
3 | 10001011212212102002210121010 |
4 | 11101300102102012022223 |
5 | 11020234203330020243 |
6 | 121210400314515003 |
7 | 4613614055550624 |
oct | 521602222061253 |
9 | 101155772083533 |
10 | 23210310001323 |
11 | 74394899a4565 |
12 | 272a391a35a63 |
13 | cc49521103b3 |
14 | 5a3556612a4b |
15 | 2a3b47c44433 |
hex | 151c124862ab |
23210310001323 has 32 divisors (see below), whose sum is σ = 35371210636800. Its totient is φ = 13449793634816.
The previous prime is 23210310001301. The next prime is 23210310001327. The reversal of 23210310001323 is 32310001301232.
It is a cyclic number.
It is not a de Polignac number, because 23210310001323 - 218 = 23210309739179 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23210310001323.
It is not an unprimeable number, because it can be changed into a prime (23210310001327) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 341123493 + ... + 341191526.
It is an arithmetic number, because the mean of its divisors is an integer number (1105350332400).
Almost surely, 223210310001323 is an apocalyptic number.
23210310001323 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
23210310001323 is a deficient number, since it is larger than the sum of its proper divisors (12160900635477).
23210310001323 is a wasteful number, since it uses less digits than its factorization.
23210310001323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 682315091.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23210310001323 its reverse (32310001301232), we get a palindrome (55520311302555).
The spelling of 23210310001323 in words is "twenty-three trillion, two hundred ten billion, three hundred ten million, one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •