Base | Representation |
---|---|
bin | 10100100001000000… |
… | …01100010001111001 |
3 | 1001102121100001000000 |
4 | 22100200030101321 |
5 | 140024124330401 |
6 | 5020534303213 |
7 | 536641641144 |
oct | 122040142171 |
9 | 31377301000 |
10 | 11014292601 |
11 | 4742310064 |
12 | 21747b7b09 |
13 | 1066b90000 |
14 | 766b5105b |
15 | 446e64186 |
hex | 29080c479 |
11014292601 has 105 divisors (see below), whose sum is σ = 18701637689. Its totient is φ = 6483329424.
The previous prime is 11014292599. The next prime is 11014292617. The reversal of 11014292601 is 10629241011.
The square root of 11014292601 is 104949.
It is a perfect power (a square), and thus also a powerful number.
11014292601 is a `hidden beast` number, since 1 + 10 + 1 + 42 + 9 + 2 + 601 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5461062201 + 5553230400 = 73899^2 + 74520^2 .
It is not a de Polignac number, because 11014292601 - 21 = 11014292599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11014292671) by changing a digit.
It is a polite number, since it can be written in 104 ways as a sum of consecutive naturals, for example, 478882276 + ... + 478882298.
Almost surely, 211014292601 is an apocalyptic number.
11014292601 is the 104949-th square number.
11014292601 is the 52475-th centered octagonal number.
It is an amenable number.
11014292601 is a deficient number, since it is larger than the sum of its proper divisors (7687345088).
11014292601 is an frugal number, since it uses more digits than its factorization.
11014292601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116 (or 39 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The spelling of 11014292601 in words is "eleven billion, fourteen million, two hundred ninety-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •