Base | Representation |
---|---|
bin | 1001001101101010010011… |
… | …1011111000010001110001 |
3 | 1022212110002000202022222210 |
4 | 2103122210323320101301 |
5 | 2311433323302410101 |
6 | 33313443503122333 |
7 | 2063614164424545 |
oct | 223324473702161 |
9 | 38773060668883 |
10 | 10130300044401 |
11 | 3256266307a29 |
12 | 11773a0ba33a9 |
13 | 58638b245104 |
14 | 2704483bda25 |
15 | 1287a42c37d6 |
hex | 936a4ef8471 |
10130300044401 has 8 divisors (see below), whose sum is σ = 13589932166560. Its totient is φ = 6712100642592.
The previous prime is 10130300044379. The next prime is 10130300044511. The reversal of 10130300044401 is 10444000303101.
10130300044401 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 not a de Polignac number, because 10130300044401 - 29 = 10130300043889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10130300044001) 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, 10358179516 + ... + 10358180493.
It is an arithmetic number, because the mean of its divisors is an integer number (1698741520820).
Almost surely, 210130300044401 is an apocalyptic number.
It is an amenable number.
10130300044401 is a deficient number, since it is larger than the sum of its proper divisors (3459632122159).
10130300044401 is a wasteful number, since it uses less digits than its factorization.
10130300044401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20716360175.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10130300044401 its reverse (10444000303101), we get a palindrome (20574300347502).
The spelling of 10130300044401 in words is "ten trillion, one hundred thirty billion, three hundred million, forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •