Base | Representation |
---|---|
bin | 101111100000001001… |
… | …0011101011000010100 |
3 | 100202022021101210011120 |
4 | 1133000102131120110 |
5 | 3132404114442322 |
6 | 114510215003540 |
7 | 10240624230024 |
oct | 1370022353024 |
9 | 322267353146 |
10 | 102010312212 |
11 | 3a298186456 |
12 | 1792b0695b0 |
13 | 98091577b3 |
14 | 4d1a041a84 |
15 | 29c0987a5c |
hex | 17c049d614 |
102010312212 has 24 divisors (see below), whose sum is σ = 238222283712. Its totient is φ = 33975120000.
The previous prime is 102010312207. The next prime is 102010312253. The reversal of 102010312212 is 212213010201.
It is a super-3 number, since 3×1020103122123 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 102010312191 and 102010312200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3524664 + ... + 3553487.
It is an arithmetic number, because the mean of its divisors is an integer number (9925928488).
Almost surely, 2102010312212 is an apocalyptic number.
102010312212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102010312212 is an abundant number, since it is smaller than the sum of its proper divisors (136211971500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102010312212 is a wasteful number, since it uses less digits than its factorization.
102010312212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7079359 (or 7079357 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102010312212 its reverse (212213010201), we get a palindrome (314223322413).
The spelling of 102010312212 in words is "one hundred two billion, ten million, three hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •