Base | Representation |
---|---|
bin | 110000000011111101… |
… | …0111010111010111110 |
3 | 100212102000202222212220 |
4 | 1200013322322322332 |
5 | 3142334244220220 |
6 | 115225345310210 |
7 | 10312456246233 |
oct | 1400772727276 |
9 | 325360688786 |
10 | 103212101310 |
11 | 3a8545a438a |
12 | 18005635366 |
13 | 996b1273c6 |
14 | 4dd18b978a |
15 | 2a41228540 |
hex | 1807ebaebe |
103212101310 has 32 divisors (see below), whose sum is σ = 247777863840. Its totient is φ = 27515580288.
The previous prime is 103212101303. The next prime is 103212101339. The reversal of 103212101310 is 13101212301.
It is a happy number.
It is a super-2 number, since 2×1032121013102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 103212101310.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 367725 + ... + 584504.
It is an arithmetic number, because the mean of its divisors is an integer number (7743058245).
Almost surely, 2103212101310 is an apocalyptic number.
103212101310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103212101310 is an abundant number, since it is smaller than the sum of its proper divisors (144565762530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103212101310 is a wasteful number, since it uses less digits than its factorization.
103212101310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 955852.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103212101310 its reverse (13101212301), we get a palindrome (116313313611).
The spelling of 103212101310 in words is "one hundred three billion, two hundred twelve million, one hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •