Base | Representation |
---|---|
bin | 1101101100000001110011… |
… | …11101011111111000001001 |
3 | 10221120112121221120212211111 |
4 | 12312000321331133320021 |
5 | 12421130002411424113 |
6 | 144003444014530321 |
7 | 6224442422003521 |
oct | 666007175377011 |
9 | 127515557525744 |
10 | 30100103233033 |
11 | 9655422626709 |
12 | 34617278069a1 |
13 | 13a4573454c12 |
14 | 760bd2000681 |
15 | 372e8d10613d |
hex | 1b6039f5fe09 |
30100103233033 has 8 divisors (see below), whose sum is σ = 30251259979776. Its totient is φ = 29949163512000.
The previous prime is 30100103233019. The next prime is 30100103233091. The reversal of 30100103233033 is 33033230100103.
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 30100103233033 - 25 = 30100103233001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30100103232995 and 30100103233013.
It is not an unprimeable number, because it can be changed into a prime (30100103239033) 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, 53978341 + ... + 54533122.
It is an arithmetic number, because the mean of its divisors is an integer number (3781407497472).
Almost surely, 230100103233033 is an apocalyptic number.
It is an amenable number.
30100103233033 is a deficient number, since it is larger than the sum of its proper divisors (151156746743).
30100103233033 is a wasteful number, since it uses less digits than its factorization.
30100103233033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108512855.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 30100103233033 its reverse (33033230100103), we get a palindrome (63133333333136).
The spelling of 30100103233033 in words is "thirty trillion, one hundred billion, one hundred three million, two hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •