Base | Representation |
---|---|
bin | 11011100100001001011100… |
… | …101001001111010010100100 |
3 | 120220020121011211020102122010 |
4 | 123210021130221033102210 |
5 | 111342223201102230200 |
6 | 1105500520235034220 |
7 | 34351446441613050 |
oct | 3344113451172244 |
9 | 526217154212563 |
10 | 121231301211300 |
11 | 3569a9a7049675 |
12 | 1171b53159b970 |
13 | 52850a7849b87 |
14 | 21d18aa75ac60 |
15 | e037872e9150 |
hex | 6e425ca4f4a4 |
121231301211300 has 144 divisors (see below), whose sum is σ = 401016397752320. Its totient is φ = 27699995917440.
The previous prime is 121231301211269. The next prime is 121231301211323. The reversal of 121231301211300 is 3112103132121.
121231301211300 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
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, 4621030 + ... + 16242429.
Almost surely, 2121231301211300 is an apocalyptic number.
121231301211300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121231301211300 is an abundant number, since it is smaller than the sum of its proper divisors (279785096541020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121231301211300 is a wasteful number, since it uses less digits than its factorization.
121231301211300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20866250 (or 20866243 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 121231301211300 its reverse (3112103132121), we get a palindrome (124343404343421).
The spelling of 121231301211300 in words is "one hundred twenty-one trillion, two hundred thirty-one billion, three hundred one million, two hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •