Base | Representation |
---|---|
bin | 1001001100110010100010… |
… | …1010111001000001011100 |
3 | 1022211000102202120020211210 |
4 | 2103030220222321001130 |
5 | 2311212144030024312 |
6 | 33302530225544420 |
7 | 2062544213006625 |
oct | 223145052710134 |
9 | 38730382506753 |
10 | 10115330314332 |
11 | 324a984290191 |
12 | 11745037a5110 |
13 | 584b43a66b79 |
14 | 26d8281d8a4c |
15 | 1281c9e8ce3c |
hex | 93328ab905c |
10115330314332 has 48 divisors (see below), whose sum is σ = 23614910318720. Its totient is φ = 3369995399232.
The previous prime is 10115330314307. The next prime is 10115330314433. The reversal of 10115330314332 is 23341303351101.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10115330314332.
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 15 ways as a sum of consecutive naturals, for example, 199460523 + ... + 199511229.
Almost surely, 210115330314332 is an apocalyptic number.
10115330314332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10115330314332 is an abundant number, since it is smaller than the sum of its proper divisors (13499580004388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10115330314332 is a wasteful number, since it uses less digits than its factorization.
10115330314332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59170 (or 59168 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 30.
Adding to 10115330314332 its reverse (23341303351101), we get a palindrome (33456633665433).
The spelling of 10115330314332 in words is "ten trillion, one hundred fifteen billion, three hundred thirty million, three hundred fourteen thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •