Base | Representation |
---|---|
bin | 10110100110010110111… |
… | …101111110011111011001 |
3 | 12111110121100122011010000 |
4 | 112212112331332133121 |
5 | 200421034100214001 |
6 | 3145240135043213 |
7 | 220126120250202 |
oct | 26462675763731 |
9 | 5443540564100 |
10 | 1553016023001 |
11 | 5496a3070133 |
12 | 210b99b10509 |
13 | b35aac8aa11 |
14 | 552487745a9 |
15 | 2a5e68eaa86 |
hex | 16996f7e7d9 |
1553016023001 has 10 divisors (see below), whose sum is σ = 2319937515962. Its totient is φ = 1035344015280.
The previous prime is 1553016022993. The next prime is 1553016023011. The reversal of 1553016023001 is 1003206103551.
1553016023001 is a `hidden beast` number, since 1 + 5 + 53 + 0 + 1 + 602 + 3 + 0 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1130904633600 + 422111389401 = 1063440^2 + 649701^2 .
It is not a de Polignac number, because 1553016023001 - 23 = 1553016022993 is a prime.
It is a super-2 number, since 2×15530160230012 (a number of 25 digits) contains 22 as substring.
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 (1553016023011) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 9586518580 + ... + 9586518741.
Almost surely, 21553016023001 is an apocalyptic number.
It is an amenable number.
1553016023001 is a deficient number, since it is larger than the sum of its proper divisors (766921492961).
1553016023001 is an equidigital number, since it uses as much as digits as its factorization.
1553016023001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19173037333 (or 19173037324 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The spelling of 1553016023001 in words is "one trillion, five hundred fifty-three billion, sixteen million, twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •