Base | Representation |
---|---|
bin | 1101101110111101110010… |
… | …10000010100011010000111 |
3 | 10221221012010020011101012001 |
4 | 12313132321100110122013 |
5 | 12424303143404333111 |
6 | 144122054122210131 |
7 | 6234644335622320 |
oct | 667367120243207 |
9 | 127835106141161 |
10 | 30201023121031 |
11 | 9694200238224 |
12 | 34791b1653947 |
13 | 13b0c37702489 |
14 | 765a472b7447 |
15 | 3758e7e9a1c1 |
hex | 1b77b9414687 |
30201023121031 has 8 divisors (see below), whose sum is σ = 34838029342080. Its totient is φ = 25644660486648.
The previous prime is 30201023121023. The next prime is 30201023121041. The reversal of 30201023121031 is 13012132010203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30201023121031 - 23 = 30201023121023 is a prime.
It is a super-2 number, since 2×302010231210312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201023121011) 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, 20160895861 + ... + 20160897358.
It is an arithmetic number, because the mean of its divisors is an integer number (4354753667760).
Almost surely, 230201023121031 is an apocalyptic number.
30201023121031 is a deficient number, since it is larger than the sum of its proper divisors (4637006221049).
30201023121031 is a wasteful number, since it uses less digits than its factorization.
30201023121031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40321793333.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30201023121031 its reverse (13012132010203), we get a palindrome (43213155131234).
The spelling of 30201023121031 in words is "thirty trillion, two hundred one billion, twenty-three million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •