Base | Representation |
---|---|
bin | 1001001100000011000010… |
… | …0000001000110010100100 |
3 | 1022202210111221121011110220 |
4 | 2103000300200020302210 |
5 | 2311010034130424142 |
6 | 33253020522044340 |
7 | 2061613162013646 |
oct | 223006040106244 |
9 | 38683457534426 |
10 | 10102576811172 |
11 | 324552a26652a |
12 | 1171b446496b0 |
13 | 58389077c1b1 |
14 | 26cd784b6896 |
15 | 127bd04cc2ec |
hex | 93030808ca4 |
10102576811172 has 24 divisors (see below), whose sum is σ = 23574895209600. Its totient is φ = 3367209034656.
The previous prime is 10102576811149. The next prime is 10102576811231. The reversal of 10102576811172 is 27111867520101.
It is a happy number.
It is a super-2 number, since 2×101025768111722 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39438147 + ... + 39693482.
It is an arithmetic number, because the mean of its divisors is an integer number (982287300400).
Almost surely, 210102576811172 is an apocalyptic number.
10102576811172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10102576811172 is an abundant number, since it is smaller than the sum of its proper divisors (13472318398428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102576811172 is a wasteful number, since it uses less digits than its factorization.
10102576811172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79142275 (or 79142273 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 42.
The spelling of 10102576811172 in words is "ten trillion, one hundred two billion, five hundred seventy-six million, eight hundred eleven thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •