Base | Representation |
---|---|
bin | 1010100000111000100011… |
… | …11101100111101011001010 |
3 | 10000212021001020111020122110 |
4 | 11100130101331213223022 |
5 | 11012244441220222310 |
6 | 121101122042403150 |
7 | 4604241613116012 |
oct | 520342175475312 |
9 | 100767036436573 |
10 | 23120110320330 |
11 | 7404202599161 |
12 | 27149ba2004b6 |
13 | cb92a8b160aa |
14 | 59d03adb6c42 |
15 | 2a16190c2d20 |
hex | 150711f67aca |
23120110320330 has 32 divisors (see below), whose sum is σ = 56535213164544. Its totient is φ = 6049035152576.
The previous prime is 23120110320313. The next prime is 23120110320397. The reversal of 23120110320330 is 3302301102132.
It is a super-2 number, since 2×231201103203302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23120110320297 and 23120110320306.
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, 7270473354 + ... + 7270476533.
It is an arithmetic number, because the mean of its divisors is an integer number (1766725411392).
Almost surely, 223120110320330 is an apocalyptic number.
23120110320330 is an abundant number, since it is smaller than the sum of its proper divisors (33415102844214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23120110320330 is a wasteful number, since it uses less digits than its factorization.
23120110320330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14540949950.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23120110320330 its reverse (3302301102132), we get a palindrome (26422411422462).
The spelling of 23120110320330 in words is "twenty-three trillion, one hundred twenty billion, one hundred ten million, three hundred twenty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •