Base | Representation |
---|---|
bin | 1101110010001011000100… |
… | …01111001010110010101001 |
3 | 10222022201120220021100200002 |
4 | 12321011202033022302221 |
5 | 12433104400440221101 |
6 | 144244442104352345 |
7 | 6245625410623001 |
oct | 671054217126251 |
9 | 128281526240602 |
10 | 30311232351401 |
11 | 9726a154a51a1 |
12 | 349662a4756b5 |
13 | 13bb44c368b21 |
14 | 76b1001a3001 |
15 | 3786e8621d6b |
hex | 1b91623caca9 |
30311232351401 has 8 divisors (see below), whose sum is σ = 31357114147200. Its totient is φ = 29265395014800.
The previous prime is 30311232351397. The next prime is 30311232351409. The reversal of 30311232351401 is 10415323211303.
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 30311232351401 - 22 = 30311232351397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30311232351409) 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, 9724775 + ... + 12457676.
It is an arithmetic number, because the mean of its divisors is an integer number (3919639268400).
Almost surely, 230311232351401 is an apocalyptic number.
It is an amenable number.
30311232351401 is a deficient number, since it is larger than the sum of its proper divisors (1045881795799).
30311232351401 is a wasteful number, since it uses less digits than its factorization.
30311232351401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22229599.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 30311232351401 its reverse (10415323211303), we get a palindrome (40726555562704).
The spelling of 30311232351401 in words is "thirty trillion, three hundred eleven billion, two hundred thirty-two million, three hundred fifty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •