Base | Representation |
---|---|
bin | 11110010001101101101… |
… | …01100100111010000100 |
3 | 10200110012102221020102010 |
4 | 33020312311210322010 |
5 | 114021014314200400 |
6 | 2113524100214220 |
7 | 135105440644104 |
oct | 17106665447204 |
9 | 3613172836363 |
10 | 1040302100100 |
11 | 37120a46223a |
12 | 14974b09a370 |
13 | 7713bb02a53 |
14 | 384cabb3204 |
15 | 1c0d9a24450 |
hex | f236d64e84 |
1040302100100 has 72 divisors (see below), whose sum is σ = 3051172872160. Its totient is φ = 273613697280.
The previous prime is 1040302100087. The next prime is 1040302100107. The reversal of 1040302100100 is 10012030401.
It is a happy number.
1040302100100 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (1040302100107) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23729290 + ... + 23773089.
Almost surely, 21040302100100 is an apocalyptic number.
1040302100100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1040302100100 is an abundant number, since it is smaller than the sum of its proper divisors (2010870772060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040302100100 is a wasteful number, since it uses less digits than its factorization.
1040302100100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47502469 (or 47502462 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1040302100100 its reverse (10012030401), we get a palindrome (1050314130501).
The spelling of 1040302100100 in words is "one trillion, forty billion, three hundred two million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •