Base | Representation |
---|---|
bin | 10111001111011000100010… |
… | …011111001001110010010100 |
3 | 111101220101120200021200100022 |
4 | 113033120202133021302110 |
5 | 101344121101314131400 |
6 | 1001215350255004312 |
7 | 30346405566353603 |
oct | 2717304237116224 |
9 | 441811520250308 |
10 | 102212210302100 |
11 | 2a627a56059918 |
12 | b5694b2509698 |
13 | 45057545b44c2 |
14 | 1b351512a5a3a |
15 | bc3b92b83b85 |
hex | 5cf6227c9c94 |
102212210302100 has 36 divisors (see below), whose sum is σ = 233474206694400. Its totient is φ = 38733048113760.
The previous prime is 102212210302063. The next prime is 102212210302109. The reversal of 102212210302100 is 1203012212201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102212210302109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26897948180 + ... + 26897951979.
It is an arithmetic number, because the mean of its divisors is an integer number (6485394630400).
Almost surely, 2102212210302100 is an apocalyptic number.
102212210302100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102212210302100 is an abundant number, since it is smaller than the sum of its proper divisors (131261996392300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212210302100 is a wasteful number, since it uses less digits than its factorization.
102212210302100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53795900192 (or 53795900185 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 102212210302100 its reverse (1203012212201), we get a palindrome (103415222514301).
The spelling of 102212210302100 in words is "one hundred two trillion, two hundred twelve billion, two hundred ten million, three hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •