Base | Representation |
---|---|
bin | 11101101101110100010… |
… | …10101010000100011001 |
3 | 10121121110101012212010100 |
4 | 32312322022222010121 |
5 | 113212032313330311 |
6 | 2101015513210013 |
7 | 133524042642324 |
oct | 16667212520431 |
9 | 3547411185110 |
10 | 1021030605081 |
11 | 364020181853 |
12 | 145a71100909 |
13 | 7538a337b66 |
14 | 375bd5657bb |
15 | 1b85cc0ba56 |
hex | edba2aa119 |
1021030605081 has 48 divisors (see below), whose sum is σ = 1575500492800. Its totient is φ = 635319580896.
The previous prime is 1021030605079. The next prime is 1021030605103. The reversal of 1021030605081 is 1805060301201.
1021030605081 is a `hidden beast` number, since 1 + 0 + 21 + 0 + 30 + 605 + 0 + 8 + 1 = 666.
1021030605081 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1021030605081 - 21 = 1021030605079 is a prime.
It is a super-2 number, since 2×10210306050812 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1021030605031) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6173046 + ... + 6336288.
Almost surely, 21021030605081 is an apocalyptic number.
It is an amenable number.
1021030605081 is a deficient number, since it is larger than the sum of its proper divisors (554469887719).
1021030605081 is a wasteful number, since it uses less digits than its factorization.
1021030605081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163810 (or 163807 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 1021030605081 its reverse (1805060301201), we get a palindrome (2826090906282).
The spelling of 1021030605081 in words is "one trillion, twenty-one billion, thirty million, six hundred five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •