Base | Representation |
---|---|
bin | 1010000000101010001111… |
… | …0000000111000100000001 |
3 | 1102222012120200001222022011 |
4 | 2200022203300013010001 |
5 | 2420312204044313101 |
6 | 35224143412412521 |
7 | 2214122115131416 |
oct | 240124360070401 |
9 | 42865520058264 |
10 | 11006453510401 |
11 | 35638a1083888 |
12 | 129915b017141 |
13 | 61ab9a44856b |
14 | 2a0a026b810d |
15 | 141483025751 |
hex | a02a3c07101 |
11006453510401 has 8 divisors (see below), whose sum is σ = 11386390723200. Its totient is φ = 10626543253200.
The previous prime is 11006453510387. The next prime is 11006453510431. The reversal of 11006453510401 is 10401535460011.
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 11006453510401 - 215 = 11006453477633 is a prime.
It is a super-2 number, since 2×110064535104012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11006453510431) 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, 5906425 + ... + 7543126.
It is an arithmetic number, because the mean of its divisors is an integer number (1423298840400).
Almost surely, 211006453510401 is an apocalyptic number.
It is an amenable number.
11006453510401 is a deficient number, since it is larger than the sum of its proper divisors (379937212799).
11006453510401 is a wasteful number, since it uses less digits than its factorization.
11006453510401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13477799.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 11006453510401 its reverse (10401535460011), we get a palindrome (21407988970412).
The spelling of 11006453510401 in words is "eleven trillion, six billion, four hundred fifty-three million, five hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •