Base | Representation |
---|---|
bin | 1010011101011110110101… |
… | …10001010100110000001110 |
3 | 10000110002022222011120122021 |
4 | 11032233122301110300032 |
5 | 11003341043334430410 |
6 | 120531311122240354 |
7 | 4562633145556036 |
oct | 516573261246016 |
9 | 100402288146567 |
10 | 23003220233230 |
11 | 736967a146696 |
12 | 26b6217ab60ba |
13 | cab26b017a93 |
14 | 59750cac88c6 |
15 | 29d577172eda |
hex | 14ebdac54c0e |
23003220233230 has 64 divisors (see below), whose sum is σ = 42471805239360. Its totient is φ = 8964996275200.
The previous prime is 23003220233219. The next prime is 23003220233237. The reversal of 23003220233230 is 3233202230032.
It is a super-3 number, since 3×230032202332303 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23003220233195 and 23003220233204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23003220233237) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 2742719097 + ... + 2742727483.
It is an arithmetic number, because the mean of its divisors is an integer number (663621956865).
Almost surely, 223003220233230 is an apocalyptic number.
23003220233230 is a deficient number, since it is larger than the sum of its proper divisors (19468585006130).
23003220233230 is a wasteful number, since it uses less digits than its factorization.
23003220233230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16485.
The product of its (nonzero) digits is 7776, while the sum is 25.
Adding to 23003220233230 its reverse (3233202230032), we get a palindrome (26236422463262).
The spelling of 23003220233230 in words is "twenty-three trillion, three billion, two hundred twenty million, two hundred thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •