Base | Representation |
---|---|
bin | 11011100101001001101101… |
… | …010011000111010110100110 |
3 | 120220111012021110211012101120 |
4 | 123211021231103013112212 |
5 | 111344341003311213110 |
6 | 1105552331044434410 |
7 | 34356441341525631 |
oct | 3345115523072646 |
9 | 526435243735346 |
10 | 121300300101030 |
11 | 35717194129786 |
12 | 117309890a8a06 |
13 | 528b752758b8b |
14 | 21d4d74416c18 |
15 | e05474aa9870 |
hex | 6e526d4c75a6 |
121300300101030 has 128 divisors (see below), whose sum is σ = 292659547340160. Its totient is φ = 32176294440960.
The previous prime is 121300300100951. The next prime is 121300300101037. The reversal of 121300300101030 is 30101003003121.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121300300101037) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12336036994 + ... + 12336046826.
It is an arithmetic number, because the mean of its divisors is an integer number (2286402713595).
Almost surely, 2121300300101030 is an apocalyptic number.
121300300101030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121300300101030 is an abundant number, since it is smaller than the sum of its proper divisors (171359247239130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121300300101030 is a wasteful number, since it uses less digits than its factorization.
121300300101030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12986.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 121300300101030 its reverse (30101003003121), we get a palindrome (151401303104151).
The spelling of 121300300101030 in words is "one hundred twenty-one trillion, three hundred billion, three hundred million, one hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •