Base | Representation |
---|---|
bin | 111000011111011100… |
… | …0111100110111000110 |
3 | 102121010121001221101200 |
4 | 1300332320330313012 |
5 | 3441422413413110 |
6 | 131421520203330 |
7 | 11523164460201 |
oct | 1607670746706 |
9 | 377117057350 |
10 | 121314201030 |
11 | 474a3781880 |
12 | 1b617a69546 |
13 | b594555109 |
14 | 5c2bac2938 |
15 | 325054d6c0 |
hex | 1c3ee3cdc6 |
121314201030 has 96 divisors (see below), whose sum is σ = 353391056928. Its totient is φ = 28614643200.
The previous prime is 121314201023. The next prime is 121314201061. The reversal of 121314201030 is 30102413121.
121314201030 is a `hidden beast` number, since 1 + 213 + 1 + 420 + 1 + 0 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 121314200994 and 121314201012.
It is a congruent number.
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, 1619311 + ... + 1692570.
It is an arithmetic number, because the mean of its divisors is an integer number (3681156843).
Almost surely, 2121314201030 is an apocalyptic number.
121314201030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121314201030 is an abundant number, since it is smaller than the sum of its proper divisors (232076855898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121314201030 is a wasteful number, since it uses less digits than its factorization.
121314201030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3311942 (or 3311939 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 121314201030 its reverse (30102413121), we get a palindrome (151416614151).
The spelling of 121314201030 in words is "one hundred twenty-one billion, three hundred fourteen million, two hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •