Base | Representation |
---|---|
bin | 1001001011111011011110… |
… | …1101000010111101000001 |
3 | 1022202121021201002012202010 |
4 | 2102332313231002331001 |
5 | 2310441411314331001 |
6 | 33252043443443133 |
7 | 2061512022466431 |
oct | 222766755027501 |
9 | 38677251065663 |
10 | 10100550152001 |
11 | 324468a2704a1 |
12 | 11716799864a9 |
13 | 58362992c69a |
14 | 26cc2527c2c1 |
15 | 127b126008d6 |
hex | 92fb7b42f41 |
10100550152001 has 8 divisors (see below), whose sum is σ = 13753940632704. Its totient is φ = 6590429886320.
The previous prime is 10100550151961. The next prime is 10100550152107. The reversal of 10100550152001 is 10025105500101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10100550152001 - 223 = 10100541763393 is a prime.
It is a super-3 number, since 3×101005501520013 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10100550152401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35817553590 + ... + 35817553871.
It is an arithmetic number, because the mean of its divisors is an integer number (1719242579088).
Almost surely, 210100550152001 is an apocalyptic number.
It is an amenable number.
10100550152001 is a deficient number, since it is larger than the sum of its proper divisors (3653390480703).
10100550152001 is an equidigital number, since it uses as much as digits as its factorization.
10100550152001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71635107511.
The product of its (nonzero) digits is 250, while the sum is 21.
Adding to 10100550152001 its reverse (10025105500101), we get a palindrome (20125655652102).
The spelling of 10100550152001 in words is "ten trillion, one hundred billion, five hundred fifty million, one hundred fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •