Base | Representation |
---|---|
bin | 1101110110100010101100… |
… | …00000111100011001110111 |
3 | 10222212002001221021112021001 |
4 | 12323101112000330121313 |
5 | 12443034321343314343 |
6 | 144441430155304131 |
7 | 6262521451436266 |
oct | 673212600743167 |
9 | 128762057245231 |
10 | 30461351151223 |
11 | 978464a665413 |
12 | 34bb744a4b047 |
13 | 13cc654411b25 |
14 | 7744a163a5dd |
15 | 37c58286b44d |
hex | 1bb45603c677 |
30461351151223 has 4 divisors (see below), whose sum is σ = 30461366097720. Its totient is φ = 30461336204728.
The previous prime is 30461351151197. The next prime is 30461351151233. The reversal of 30461351151223 is 32215115316403.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30461351151223 - 229 = 30460814280311 is a prime.
It is a super-2 number, since 2×304613511512232 (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 (30461351151233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3821365 + ... + 8690542.
It is an arithmetic number, because the mean of its divisors is an integer number (7615341524430).
Almost surely, 230461351151223 is an apocalyptic number.
30461351151223 is a deficient number, since it is larger than the sum of its proper divisors (14946497).
30461351151223 is a wasteful number, since it uses less digits than its factorization.
30461351151223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14946496.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 30461351151223 its reverse (32215115316403), we get a palindrome (62676466467626).
The spelling of 30461351151223 in words is "thirty trillion, four hundred sixty-one billion, three hundred fifty-one million, one hundred fifty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •