Base | Representation |
---|---|
bin | 1001001100100011100001… |
… | …1110000111010010000110 |
3 | 1022210122000220122001221202 |
4 | 2103020320132013102012 |
5 | 2311130420402324110 |
6 | 33301022311342502 |
7 | 2062342310410556 |
oct | 223107036072206 |
9 | 38718026561852 |
10 | 10111300433030 |
11 | 32491a6547775 |
12 | 117377a081a32 |
13 | 584650bb2514 |
14 | 26d564d07166 |
15 | 1280412b40a5 |
hex | 93238787486 |
10111300433030 has 8 divisors (see below), whose sum is σ = 18200340779472. Its totient is φ = 4044520173208.
The previous prime is 10111300433027. The next prime is 10111300433083. The reversal of 10111300433030 is 3033400311101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10111300432993 and 10111300433011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505565021642 + ... + 505565021661.
It is an arithmetic number, because the mean of its divisors is an integer number (2275042597434).
Almost surely, 210111300433030 is an apocalyptic number.
10111300433030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10111300433030 is a deficient number, since it is larger than the sum of its proper divisors (8089040346442).
10111300433030 is a wasteful number, since it uses less digits than its factorization.
10111300433030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011130043310.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10111300433030 its reverse (3033400311101), we get a palindrome (13144700744131).
The spelling of 10111300433030 in words is "ten trillion, one hundred eleven billion, three hundred million, four hundred thirty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •