Base | Representation |
---|---|
bin | 1001011010001011100111… |
… | …1101010010011011110101 |
3 | 1100122000021210100010102111 |
4 | 2112202321331102123311 |
5 | 2323444340140200041 |
6 | 34000340041211021 |
7 | 2115300453301021 |
oct | 226427175223365 |
9 | 40560253303374 |
10 | 10345401100021 |
11 | 3329507242789 |
12 | 11b1011a90a71 |
13 | 5a074b003450 |
14 | 27aa11cad381 |
15 | 12e19336e981 |
hex | 968b9f526f5 |
10345401100021 has 8 divisors (see below), whose sum is σ = 11625601236480. Its totient is φ = 9134400970992.
The previous prime is 10345401099997. The next prime is 10345401100103. The reversal of 10345401100021 is 12000110454301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10345401100021 - 25 = 10345401099989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10345401099965 and 10345401100001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10345471100021) 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, 17300001541 + ... + 17300002138.
It is an arithmetic number, because the mean of its divisors is an integer number (1453200154560).
Almost surely, 210345401100021 is an apocalyptic number.
It is an amenable number.
10345401100021 is a deficient number, since it is larger than the sum of its proper divisors (1280200136459).
10345401100021 is a wasteful number, since it uses less digits than its factorization.
10345401100021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34600003715.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 10345401100021 its reverse (12000110454301), we get a palindrome (22345511554322).
The spelling of 10345401100021 in words is "ten trillion, three hundred forty-five billion, four hundred one million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •