Base | Representation |
---|---|
bin | 101111100011110001… |
… | …1011110001001010110 |
3 | 100202121202202221200000 |
4 | 1133013203132021112 |
5 | 3133131321243220 |
6 | 114530251432130 |
7 | 10243634323632 |
oct | 1370743361126 |
9 | 322552687600 |
10 | 102132212310 |
11 | 3a34aa75837 |
12 | 17963a55646 |
13 | 982849852b |
14 | 4d2c2d3dc2 |
15 | 29cb516390 |
hex | 17c78de256 |
102132212310 has 96 divisors (see below), whose sum is σ = 287351850240. Its totient is φ = 26051100768.
The previous prime is 102132212297. The next prime is 102132212327. The reversal of 102132212310 is 13212231201.
102132212310 is a `hidden beast` number, since 1 + 0 + 21 + 322 + 12 + 310 = 666.
It is a super-2 number, since 2×1021322123102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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, 857800 + ... + 969579.
It is an arithmetic number, because the mean of its divisors is an integer number (2993248440).
Almost surely, 2102132212310 is an apocalyptic number.
102132212310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102132212310 is an abundant number, since it is smaller than the sum of its proper divisors (185219637930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102132212310 is a wasteful number, since it uses less digits than its factorization.
102132212310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1827424 (or 1827412 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 102132212310 its reverse (13212231201), we get a palindrome (115344443511).
The spelling of 102132212310 in words is "one hundred two billion, one hundred thirty-two million, two hundred twelve thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •