Base | Representation |
---|---|
bin | 10111011011000010101000… |
… | …011010000001101010011110 |
3 | 111111201222101110102211202002 |
4 | 113123002220122001222132 |
5 | 102000232240140201420 |
6 | 1003031355534002302 |
7 | 30461316061210442 |
oct | 2733025032015236 |
9 | 444658343384662 |
10 | 103013321022110 |
11 | 2a90678218aa34 |
12 | b678808946392 |
13 | 45631646c6045 |
14 | 1b61c2ad5a822 |
15 | bd992d728075 |
hex | 5db0a8681a9e |
103013321022110 has 16 divisors (see below), whose sum is σ = 185424290347536. Its totient is φ = 41205258962688.
The previous prime is 103013321022011. The next prime is 103013321022119. The reversal of 103013321022110 is 11220123310301.
It is a happy number.
It is a super-2 number, since 2×1030133210221102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103013321022119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2221832 + ... + 14524571.
It is an arithmetic number, because the mean of its divisors is an integer number (11589018146721).
Almost surely, 2103013321022110 is an apocalyptic number.
103013321022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103013321022110 is a deficient number, since it is larger than the sum of its proper divisors (82410969325426).
103013321022110 is a wasteful number, since it uses less digits than its factorization.
103013321022110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17361547.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 103013321022110 its reverse (11220123310301), we get a palindrome (114233444332411).
The spelling of 103013321022110 in words is "one hundred three trillion, thirteen billion, three hundred twenty-one million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •