Base | Representation |
---|---|
bin | 1001010000000110100110… |
… | …1011110111111111100111 |
3 | 1100000110100222122202012110 |
4 | 2110001221223313333213 |
5 | 2313130234422304101 |
6 | 33345023021452103 |
7 | 2066630656345515 |
oct | 224015153677747 |
9 | 40013328582173 |
10 | 10172255666151 |
11 | 3272036151597 |
12 | 118354ba11033 |
13 | 58a3165043b7 |
14 | 2724a85b34b5 |
15 | 12990c803cd6 |
hex | 94069af7fe7 |
10172255666151 has 4 divisors (see below), whose sum is σ = 13563007554872. Its totient is φ = 6781503777432.
The previous prime is 10172255666113. The next prime is 10172255666191. The reversal of 10172255666151 is 15166655227101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10172255666151 - 29 = 10172255665639 is a prime.
It is a super-2 number, since 2×101722556661512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10172255666151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10172255666191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1695375944356 + ... + 1695375944361.
It is an arithmetic number, because the mean of its divisors is an integer number (3390751888718).
Almost surely, 210172255666151 is an apocalyptic number.
10172255666151 is a deficient number, since it is larger than the sum of its proper divisors (3390751888721).
10172255666151 is an equidigital number, since it uses as much as digits as its factorization.
10172255666151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3390751888720.
The product of its (nonzero) digits is 756000, while the sum is 48.
The spelling of 10172255666151 in words is "ten trillion, one hundred seventy-two billion, two hundred fifty-five million, six hundred sixty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •