Base | Representation |
---|---|
bin | 11101110001100001110… |
… | …11011011000011011000 |
3 | 10121210121020110002110220 |
4 | 32320300323123003120 |
5 | 113230122403200440 |
6 | 2101545331240040 |
7 | 133624315605630 |
oct | 16706073330330 |
9 | 3553536402426 |
10 | 1023023100120 |
11 | 36495296286a |
12 | 146328449020 |
13 | 756170851c8 |
14 | 3772c0296c0 |
15 | 1b927ada8d0 |
hex | ee30edb0d8 |
1023023100120 has 64 divisors (see below), whose sum is σ = 3507507774720. Its totient is φ = 233833851264.
The previous prime is 1023023100119. The next prime is 1023023100131. The reversal of 1023023100120 is 210013203201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1023023100120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 608941482 + ... + 608943161.
It is an arithmetic number, because the mean of its divisors is an integer number (54804808980).
Almost surely, 21023023100120 is an apocalyptic number.
1023023100120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1023023100120 is an abundant number, since it is smaller than the sum of its proper divisors (2484484674600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023023100120 is a wasteful number, since it uses less digits than its factorization.
1023023100120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1217884664 (or 1217884660 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1023023100120 its reverse (210013203201), we get a palindrome (1233036303321).
The spelling of 1023023100120 in words is "one trillion, twenty-three billion, twenty-three million, one hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •