Base | Representation |
---|---|
bin | 1001000111111100111001… |
… | …0100110101011011110001 |
3 | 1022112001212222102011122202 |
4 | 2101333032110311123301 |
5 | 2303331431303020101 |
6 | 33200422253312545 |
7 | 2053542343512620 |
oct | 221771624653361 |
9 | 38461788364582 |
10 | 10032210204401 |
11 | 3218700137360 |
12 | 1160386a95755 |
13 | 57a0583b5878 |
14 | 2697c0d0d6b7 |
15 | 125e62b0236b |
hex | 91fce5356f1 |
10032210204401 has 8 divisors (see below), whose sum is σ = 12507690644544. Its totient is φ = 7817306652720.
The previous prime is 10032210204371. The next prime is 10032210204413. The reversal of 10032210204401 is 10440201223001.
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 10032210204401 - 226 = 10032143095537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10032210203401) 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, 65144222030 + ... + 65144222183.
It is an arithmetic number, because the mean of its divisors is an integer number (1563461330568).
Almost surely, 210032210204401 is an apocalyptic number.
10032210204401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10032210204401 is a deficient number, since it is larger than the sum of its proper divisors (2475480440143).
10032210204401 is a wasteful number, since it uses less digits than its factorization.
10032210204401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130288444231.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10032210204401 its reverse (10440201223001), we get a palindrome (20472411427402).
The spelling of 10032210204401 in words is "ten trillion, thirty-two billion, two hundred ten million, two hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •