Base | Representation |
---|---|
bin | 110111111011010100… |
… | …1001010000000001000 |
3 | 102111000010021212201222 |
4 | 1233312221022000020 |
5 | 3431432114213000 |
6 | 131101340501212 |
7 | 11451146004650 |
oct | 1576651120010 |
9 | 374003255658 |
10 | 120102101000 |
11 | 46a31561112 |
12 | 1b339b4a808 |
13 | b4303b526b |
14 | 5b54b23360 |
15 | 31cde22a85 |
hex | 1bf6a4a008 |
120102101000 has 64 divisors (see below), whose sum is σ = 321187351680. Its totient is φ = 41177860800.
The previous prime is 120102100999. The next prime is 120102101027. The reversal of 120102101000 is 101201021.
120102101000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1201021010002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
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, 8571722 + ... + 8585721.
It is an arithmetic number, because the mean of its divisors is an integer number (5018552370).
Almost surely, 2120102101000 is an apocalyptic number.
120102101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120102101000 is an abundant number, since it is smaller than the sum of its proper divisors (201085250680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120102101000 is a wasteful number, since it uses less digits than its factorization.
120102101000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17157471 (or 17157457 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 120102101000 its reverse (101201021), we get a palindrome (120203302021).
The spelling of 120102101000 in words is "one hundred twenty billion, one hundred two million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •