Base | Representation |
---|---|
bin | 10111011111110011110100… |
… | …110110101000010001101010 |
3 | 111112220022020102221210020211 |
4 | 113133303310312220101222 |
5 | 102021114402400300320 |
6 | 1003442113144011334 |
7 | 30524066561016052 |
oct | 2737636466502152 |
9 | 445808212853224 |
10 | 103341021103210 |
11 | 2aa22754355140 |
12 | b710222a60b4a |
13 | 458802a272787 |
14 | 1b73a36c9a562 |
15 | be320cb5855a |
hex | 5dfcf4da846a |
103341021103210 has 32 divisors (see below), whose sum is σ = 209470128413184. Its totient is φ = 36366341736000.
The previous prime is 103341021103181. The next prime is 103341021103211. The reversal of 103341021103210 is 12301120143301.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (103341021103211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15152638981 + ... + 15152645800.
It is an arithmetic number, because the mean of its divisors is an integer number (6545941512912).
Almost surely, 2103341021103210 is an apocalyptic number.
103341021103210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103341021103210 is an abundant number, since it is smaller than the sum of its proper divisors (106129107309974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103341021103210 is a wasteful number, since it uses less digits than its factorization.
103341021103210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30305284830.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 103341021103210 its reverse (12301120143301), we get a palindrome (115642141246511).
The spelling of 103341021103210 in words is "one hundred three trillion, three hundred forty-one billion, twenty-one million, one hundred three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •