Base | Representation |
---|---|
bin | 1101101100000111110001… |
… | …00000100110011101000111 |
3 | 10221120211212202001212012000 |
4 | 12312003320200212131013 |
5 | 12421203024311343210 |
6 | 144005133135000343 |
7 | 6224614560661161 |
oct | 666037040463507 |
9 | 127524782055160 |
10 | 30103300106055 |
11 | 9656813133730 |
12 | 346227a3690b3 |
13 | 13a496286a367 |
14 | 761016813931 |
15 | 3730c8ad7ac0 |
hex | 1b60f8826747 |
30103300106055 has 64 divisors (see below), whose sum is σ = 59806112970240. Its totient is φ = 14239550649600.
The previous prime is 30103300106051. The next prime is 30103300106083. The reversal of 30103300106055 is 55060100330103.
30103300106055 is a `hidden beast` number, since 3 + 0 + 10 + 3 + 30 + 0 + 10 + 605 + 5 = 666.
It is not a de Polignac number, because 30103300106055 - 22 = 30103300106051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30103300106051) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 247153537 + ... + 247275306.
It is an arithmetic number, because the mean of its divisors is an integer number (934470515160).
Almost surely, 230103300106055 is an apocalyptic number.
30103300106055 is a deficient number, since it is larger than the sum of its proper divisors (29702812864185).
30103300106055 is a wasteful number, since it uses less digits than its factorization.
30103300106055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 494428909 (or 494428903 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 27.
Adding to 30103300106055 its reverse (55060100330103), we get a palindrome (85163400436158).
The spelling of 30103300106055 in words is "thirty trillion, one hundred three billion, three hundred million, one hundred six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •