Base | Representation |
---|---|
bin | 1010011101011101001010… |
… | …01100001010111101001010 |
3 | 10000110000000022200002212220 |
4 | 11032232211030022331022 |
5 | 11003332223223120242 |
6 | 120531042011114510 |
7 | 4562601652016226 |
oct | 516564514127512 |
9 | 100400008602786 |
10 | 23002321301322 |
11 | 7369258783860 |
12 | 26b6006a42a36 |
13 | cab156a065cc |
14 | 597465569786 |
15 | 29d5232a7bec |
hex | 14eba530af4a |
23002321301322 has 32 divisors (see below), whose sum is σ = 50439078259200. Its totient is φ = 6935373252720.
The previous prime is 23002321301261. The next prime is 23002321301341. The reversal of 23002321301322 is 22310312320032.
It is a junction number, because it is equal to n+sod(n) for n = 23002321301292 and 23002321301301.
It is an unprimeable number.
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, 875665308 + ... + 875691575.
It is an arithmetic number, because the mean of its divisors is an integer number (1576221195600).
Almost surely, 223002321301322 is an apocalyptic number.
23002321301322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
23002321301322 is an abundant number, since it is smaller than the sum of its proper divisors (27436756957878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23002321301322 is a wasteful number, since it uses less digits than its factorization.
23002321301322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1751357098.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 23002321301322 its reverse (22310312320032), we get a palindrome (45312633621354).
The spelling of 23002321301322 in words is "twenty-three trillion, two billion, three hundred twenty-one million, three hundred one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •