Base | Representation |
---|---|
bin | 1001010111100110101000… |
… | …0101000110111111000010 |
3 | 1100110202222011021011122000 |
4 | 2111321222011012333002 |
5 | 2322233133443100114 |
6 | 33524133141124430 |
7 | 2112142066225512 |
oct | 225715205067702 |
9 | 40422864234560 |
10 | 10301111300034 |
11 | 33117498634a5 |
12 | 11a45113b9716 |
13 | 5995102932c9 |
14 | 27880dab1842 |
15 | 12ce4ee6ae09 |
hex | 95e6a146fc2 |
10301111300034 has 64 divisors (see below), whose sum is σ = 23450380450560. Its totient is φ = 3349855440000.
The previous prime is 10301111300023. The next prime is 10301111300041. The reversal of 10301111300034 is 43000311110301.
10301111300034 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×103011113000342 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128883484 + ... + 128963384.
It is an arithmetic number, because the mean of its divisors is an integer number (366412194540).
Almost surely, 210301111300034 is an apocalyptic number.
10301111300034 is an abundant number, since it is smaller than the sum of its proper divisors (13149269150526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10301111300034 is a wasteful number, since it uses less digits than its factorization.
10301111300034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138184 (or 138178 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10301111300034 its reverse (43000311110301), we get a palindrome (53301422410335).
The spelling of 10301111300034 in words is "ten trillion, three hundred one billion, one hundred eleven million, three hundred thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •