Base | Representation |
---|---|
bin | 1101101111010001001011… |
… | …10011000011101011010000 |
3 | 10221222011222210020222110122 |
4 | 12313220211303003223100 |
5 | 12424441004112221311 |
6 | 144130535145445412 |
7 | 6235463333531036 |
oct | 667504563035320 |
9 | 127864883228418 |
10 | 30211434101456 |
11 | 9698662a37983 |
12 | 347b2181a0868 |
13 | 13b1c065a711a |
14 | 766353c5c556 |
15 | 375d06e8a0db |
hex | 1b7a25cc3ad0 |
30211434101456 has 40 divisors (see below), whose sum is σ = 61825716546720. Its totient is φ = 14261837360256.
The previous prime is 30211434101449. The next prime is 30211434101533. The reversal of 30211434101456 is 65410143411203.
It is a super-2 number, since 2×302114341014562 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 169500890 + ... + 169679033.
It is an arithmetic number, because the mean of its divisors is an integer number (1545642913668).
Almost surely, 230211434101456 is an apocalyptic number.
It is an amenable number.
30211434101456 is an abundant number, since it is smaller than the sum of its proper divisors (31614282445264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30211434101456 is a wasteful number, since it uses less digits than its factorization.
30211434101456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339180243 (or 339180237 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 30211434101456 its reverse (65410143411203), we get a palindrome (95621577512659).
The spelling of 30211434101456 in words is "thirty trillion, two hundred eleven billion, four hundred thirty-four million, one hundred one thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •