Base | Representation |
---|---|
bin | 1010011101111110010101… |
… | …10111010010010111010000 |
3 | 10000111200222122221211121020 |
4 | 11032333022313102113100 |
5 | 11004130213101330112 |
6 | 120543145254355440 |
7 | 4564102234635441 |
oct | 516771267222720 |
9 | 100450878854536 |
10 | 23020133230032 |
11 | 73758690904a4 |
12 | 26b955805bb80 |
13 | caca34c982b3 |
14 | 598274ddb2c8 |
15 | 29dc16db148c |
hex | 14efcadd25d0 |
23020133230032 has 80 divisors (see below), whose sum is σ = 60307917189120. Its totient is φ = 7565094678400.
The previous prime is 23020133230013. The next prime is 23020133230033. The reversal of 23020133230032 is 23003233102032.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 23020133229984 and 23020133230011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23020133230033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 170301769 + ... + 170436887.
It is an arithmetic number, because the mean of its divisors is an integer number (753848964864).
Almost surely, 223020133230032 is an apocalyptic number.
It is an amenable number.
23020133230032 is an abundant number, since it is smaller than the sum of its proper divisors (37287783959088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23020133230032 is a wasteful number, since it uses less digits than its factorization.
23020133230032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185192 (or 185186 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 23020133230032 its reverse (23003233102032), we get a palindrome (46023366332064).
The spelling of 23020133230032 in words is "twenty-three trillion, twenty billion, one hundred thirty-three million, two hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •