Base | Representation |
---|---|
bin | 110111111000010101… |
… | …1010101101110010000 |
3 | 102110202010221201200220 |
4 | 1233300223111232100 |
5 | 3431231003310000 |
6 | 131043403313040 |
7 | 11445522153315 |
oct | 1576053255620 |
9 | 373663851626 |
10 | 120002010000 |
11 | 46990008284 |
12 | 1b31051b780 |
13 | b41573c212 |
14 | 5b4570ad0c |
15 | 31c52511a0 |
hex | 1bf0ad5b90 |
120002010000 has 100 divisors (see below), whose sum is σ = 387382585392. Its totient is φ = 32000528000.
The previous prime is 120002009969. The next prime is 120002010067. The reversal of 120002010000 is 10200021.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-3 number, since 3×1200020100003 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1970034 + ... + 2030033.
Almost surely, 2120002010000 is an apocalyptic number.
120002010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120002010000 is an abundant number, since it is smaller than the sum of its proper divisors (267380575392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120002010000 is an equidigital number, since it uses as much as digits as its factorization.
120002010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4000098 (or 4000077 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 120002010000 its reverse (10200021), we get a palindrome (120012210021).
The spelling of 120002010000 in words is "one hundred twenty billion, two million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •