Base | Representation |
---|---|
bin | 111000100010101000… |
… | …0011110001110011100 |
3 | 102121102001002102121022 |
4 | 1301011100132032130 |
5 | 3442132240432200 |
6 | 131440254023312 |
7 | 11525632504613 |
oct | 1610520361634 |
9 | 377361072538 |
10 | 121421030300 |
11 | 47549008229 |
12 | 1b6477a7b38 |
13 | b5b071a1bb |
14 | 5c3bd7087a |
15 | 3259b01885 |
hex | 1c4541e39c |
121421030300 has 36 divisors (see below), whose sum is σ = 263498848536. Its totient is φ = 48565608000.
The previous prime is 121421030287. The next prime is 121421030327. The reversal of 121421030300 is 3030124121.
121421030300 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×1214210303002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3105875 + ... + 3144725.
Almost surely, 2121421030300 is an apocalyptic number.
121421030300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121421030300 is an abundant number, since it is smaller than the sum of its proper divisors (142077818236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121421030300 is a wasteful number, since it uses less digits than its factorization.
121421030300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70118 (or 70111 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 121421030300 its reverse (3030124121), we get a palindrome (124451154421).
The spelling of 121421030300 in words is "one hundred twenty-one billion, four hundred twenty-one million, thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •