Base | Representation |
---|---|
bin | 11011010010100001010101… |
… | …100001101101100001101010 |
3 | 120201221210121020020010101100 |
4 | 123102201111201231201222 |
5 | 111212401430230120020 |
6 | 1103132232144102230 |
7 | 34165105340066640 |
oct | 3322412541554152 |
9 | 521853536203340 |
10 | 120020001020010 |
11 | 3527321872a613 |
12 | 1156481b604976 |
13 | 51c7ab70a0960 |
14 | 218cddb53d190 |
15 | dd1ee0523a90 |
hex | 6d285586d86a |
120020001020010 has 96 divisors (see below), whose sum is σ = 384064003290240. Its totient is φ = 25322901312384.
The previous prime is 120020001019969. The next prime is 120020001020053. The reversal of 120020001020010 is 10020100020021.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 120020001019974 and 120020001020001.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7327220200 + ... + 7327236579.
It is an arithmetic number, because the mean of its divisors is an integer number (4000666700940).
Almost surely, 2120020001020010 is an apocalyptic number.
120020001020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120020001020010 is an abundant number, since it is smaller than the sum of its proper divisors (264044002270230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120020001020010 is a wasteful number, since it uses less digits than its factorization.
120020001020010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14654456812 (or 14654456809 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 120020001020010 its reverse (10020100020021), we get a palindrome (130040101040031).
The spelling of 120020001020010 in words is "one hundred twenty trillion, twenty billion, one million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •