Base | Representation |
---|---|
bin | 11110010001111011110… |
… | …00001000100101000100 |
3 | 10200110111200011220010100 |
4 | 33020331320020211010 |
5 | 114021240033223022 |
6 | 2113543515524100 |
7 | 135111403606560 |
oct | 17107570104504 |
9 | 3613450156110 |
10 | 1040420211012 |
11 | 3712700a3766 |
12 | 149782759630 |
13 | 7715a417b70 |
14 | 384dc75a6a0 |
15 | 1c0e50a51ac |
hex | f23de08944 |
1040420211012 has 144 divisors (see below), whose sum is σ = 3237514239232. Its totient is φ = 274341323520.
The previous prime is 1040420211001. The next prime is 1040420211043. The reversal of 1040420211012 is 2101120240401.
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 47 ways as a sum of consecutive naturals, for example, 17762718 + ... + 17821194.
Almost surely, 21040420211012 is an apocalyptic number.
1040420211012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1040420211012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1618757119616).
1040420211012 is an abundant number, since it is smaller than the sum of its proper divisors (2197094028220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040420211012 is a wasteful number, since it uses less digits than its factorization.
1040420211012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63938 (or 63933 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1040420211012 its reverse (2101120240401), we get a palindrome (3141540451413).
The spelling of 1040420211012 in words is "one trillion, forty billion, four hundred twenty million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •