Base | Representation |
---|---|
bin | 1001001101011001010001… |
… | …0101000100111110001111 |
3 | 1022212000021021202200102110 |
4 | 2103112110111010332033 |
5 | 2311344441434020111 |
6 | 33311410003355103 |
7 | 2063362640612514 |
oct | 223262425047617 |
9 | 38760237680373 |
10 | 10125726470031 |
11 | 32543296848a7 |
12 | 1176525382a93 |
13 | 585b0c84aba3 |
14 | 270132c0130b |
15 | 1285d7a005a6 |
hex | 93594544f8f |
10125726470031 has 8 divisors (see below), whose sum is σ = 13501023061680. Its totient is φ = 6750457095872.
The previous prime is 10125726470021. The next prime is 10125726470051. The reversal of 10125726470031 is 13007462752101.
10125726470031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10125726470031 - 239 = 9575970656143 is a prime.
It is a super-2 number, since 2×101257264700312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10125726470021) 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, 5919876 + ... + 7436153.
It is an arithmetic number, because the mean of its divisors is an integer number (1687627882710).
Almost surely, 210125726470031 is an apocalyptic number.
10125726470031 is a deficient number, since it is larger than the sum of its proper divisors (3375296591649).
10125726470031 is a wasteful number, since it uses less digits than its factorization.
10125726470031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13608745.
The product of its (nonzero) digits is 70560, while the sum is 39.
The spelling of 10125726470031 in words is "ten trillion, one hundred twenty-five billion, seven hundred twenty-six million, four hundred seventy thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •