Base | Representation |
---|---|
bin | 1101110001111000001101… |
… | …11001100010111111101001 |
3 | 10222021202110110022202022122 |
4 | 12320330012321202333221 |
5 | 12432423133131201441 |
6 | 144240045432001025 |
7 | 6245116516345631 |
oct | 670740671427751 |
9 | 128252413282278 |
10 | 30301110022121 |
11 | 97226a0728404 |
12 | 3494684530175 |
13 | 13ba4c821a483 |
14 | 76a81dab96c1 |
15 | 378304b4d34b |
hex | 1b8f06e62fe9 |
30301110022121 has 8 divisors (see below), whose sum is σ = 30367079520000. Its totient is φ = 30235161508560.
The previous prime is 30301110022097. The next prime is 30301110022151. The reversal of 30301110022121 is 12122001110303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30301110022121 - 234 = 30283930152937 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30301110022121.
It is not an unprimeable number, because it can be changed into a prime (30301110022151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2353226 + ... + 8132643.
It is an arithmetic number, because the mean of its divisors is an integer number (3795884940000).
Almost surely, 230301110022121 is an apocalyptic number.
It is an amenable number.
30301110022121 is a deficient number, since it is larger than the sum of its proper divisors (65969497879).
30301110022121 is a wasteful number, since it uses less digits than its factorization.
30301110022121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10492159.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 30301110022121 its reverse (12122001110303), we get a palindrome (42423111132424).
The spelling of 30301110022121 in words is "thirty trillion, three hundred one billion, one hundred ten million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •