Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1001000001110100000 |
3 | 100202022022201100002122 |
4 | 1133000111020032200 |
5 | 3132404304341000 |
6 | 114510242003412 |
7 | 10240633203152 |
oct | 1370025101640 |
9 | 322268640078 |
10 | 102011012000 |
11 | 3a298614197 |
12 | 1792b346568 |
13 | 9809341181 |
14 | 4d1a184ad2 |
15 | 29c0a75085 |
hex | 17c05483a0 |
102011012000 has 48 divisors (see below), whose sum is σ = 250641066312. Its totient is φ = 40804403200.
The previous prime is 102011011969. The next prime is 102011012003. The reversal of 102011012000 is 210110201.
It can be written as a sum of positive squares in 4 ways, for example, as 66227993104 + 35783018896 = 257348^2 + 189164^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is not an unprimeable number, because it can be changed into a prime (102011012003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12747377 + ... + 12755376.
Almost surely, 2102011012000 is an apocalyptic number.
102011012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102011012000 is an abundant number, since it is smaller than the sum of its proper divisors (148630054312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011012000 is an equidigital number, since it uses as much as digits as its factorization.
102011012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25502778 (or 25502760 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 102011012000 its reverse (210110201), we get a palindrome (102221122201).
It can be divided in two parts, 10201 and 1012000, that added together give a palindrome (1022201).
The spelling of 102011012000 in words is "one hundred two billion, eleven million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •