Base | Representation |
---|---|
bin | 111010011100011000010… |
… | …1111111000010001100001 |
3 | 1001102220001020022101120011 |
4 | 1310320300233320101201 |
5 | 2023100332103414103 |
6 | 25030011532044521 |
7 | 1456215345301432 |
oct | 164706057702141 |
9 | 31386036271504 |
10 | 8032406701153 |
11 | 26175851a648a |
12 | a98898903741 |
13 | 4635b6780083 |
14 | 1daab05ad489 |
15 | dde1bedad6d |
hex | 74e30bf8461 |
8032406701153 has 4 divisors (see below), whose sum is σ = 8032457181888. Its totient is φ = 8032356220420.
The previous prime is 8032406701079. The next prime is 8032406701177. The reversal of 8032406701153 is 3511076042308.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 8032406701153 - 217 = 8032406570081 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (8032406771153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25000933 + ... + 25320178.
It is an arithmetic number, because the mean of its divisors is an integer number (2008114295472).
Almost surely, 28032406701153 is an apocalyptic number.
It is an amenable number.
8032406701153 is a deficient number, since it is larger than the sum of its proper divisors (50480735).
8032406701153 is a wasteful number, since it uses less digits than its factorization.
8032406701153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50480734.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 8032406701153 in words is "eight trillion, thirty-two billion, four hundred six million, seven hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •