Base | Representation |
---|---|
bin | 101111100000100001… |
… | …0111001111100100010 |
3 | 100202100011022000011220 |
4 | 1133001002321330202 |
5 | 3132420342342010 |
6 | 114511351115510 |
7 | 10241140203024 |
oct | 1370102717442 |
9 | 322304260156 |
10 | 102023012130 |
11 | 3a2a4370056 |
12 | 17933372b96 |
13 | 980b983240 |
14 | 4d1b9ca014 |
15 | 29c1b45970 |
hex | 17c10b9f22 |
102023012130 has 64 divisors (see below), whose sum is σ = 264009932928. Its totient is φ = 25082910720.
The previous prime is 102023012093. The next prime is 102023012141. The reversal of 102023012130 is 31210320201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 164370 + ... + 480690.
It is an arithmetic number, because the mean of its divisors is an integer number (4125155202).
Almost surely, 2102023012130 is an apocalyptic number.
102023012130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 102023012130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132004966464).
102023012130 is an abundant number, since it is smaller than the sum of its proper divisors (161986920798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102023012130 is a wasteful number, since it uses less digits than its factorization.
102023012130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317171.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 102023012130 its reverse (31210320201), we get a palindrome (133233332331).
The spelling of 102023012130 in words is "one hundred two billion, twenty-three million, twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •