Base | Representation |
---|---|
bin | 1101101100011010100000… |
… | …10100101001000100011011 |
3 | 10221121210212001202002222101 |
4 | 12312031100110221010123 |
5 | 12421334132001110020 |
6 | 144013515500104231 |
7 | 6225422133503656 |
oct | 666152024510433 |
9 | 127553761662871 |
10 | 30113363300635 |
11 | 966000759076a |
12 | 3464208535077 |
13 | 13a58a7682874 |
14 | 7616cd10689d |
15 | 3734b72ca00a |
hex | 1b635052911b |
30113363300635 has 8 divisors (see below), whose sum is σ = 37707167959200. Its totient is φ = 23043269308224.
The previous prime is 30113363300591. The next prime is 30113363300653. The reversal of 30113363300635 is 53600336331103.
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 30113363300635 - 217 = 30113363169563 is a prime.
It is a super-2 number, since 2×301133633006352 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30113363300594 and 30113363300603.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130927666410 + ... + 130927666639.
It is an arithmetic number, because the mean of its divisors is an integer number (4713395994900).
Almost surely, 230113363300635 is an apocalyptic number.
30113363300635 is a deficient number, since it is larger than the sum of its proper divisors (7593804658565).
30113363300635 is a wasteful number, since it uses less digits than its factorization.
30113363300635 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261855333077.
The product of its (nonzero) digits is 131220, while the sum is 37.
Adding to 30113363300635 its reverse (53600336331103), we get a palindrome (83713699631738).
The spelling of 30113363300635 in words is "thirty trillion, one hundred thirteen billion, three hundred sixty-three million, three hundred thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •