Base | Representation |
---|---|
bin | 10000000010100001100… |
… | …111000111000010101010 |
3 | 10220101000211001110220220 |
4 | 100002201213013002222 |
5 | 121024323042341020 |
6 | 2202204304230510 |
7 | 142430054006061 |
oct | 20024147070252 |
9 | 3811024043826 |
10 | 1102223012010 |
11 | 3954a51788aa |
12 | 15975030b436 |
13 | 7cc29505cb3 |
14 | 3b4c28151d8 |
15 | 1da10c16240 |
hex | 100a19c70aa |
1102223012010 has 128 divisors (see below), whose sum is σ = 2699347230720. Its totient is φ = 287982604800.
The previous prime is 1102223012003. The next prime is 1102223012041. The reversal of 1102223012010 is 102103222011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 414524061 + ... + 414526719.
It is an arithmetic number, because the mean of its divisors is an integer number (21088650240).
Almost surely, 21102223012010 is an apocalyptic number.
1102223012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1102223012010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1349673615360).
1102223012010 is an abundant number, since it is smaller than the sum of its proper divisors (1597124218710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102223012010 is a wasteful number, since it uses less digits than its factorization.
1102223012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3924.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1102223012010 its reverse (102103222011), we get a palindrome (1204326234021).
The spelling of 1102223012010 in words is "one trillion, one hundred two billion, two hundred twenty-three million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •