Base | Representation |
---|---|
bin | 11101011101011111010… |
… | …00111000010111110101 |
3 | 10120202211102101102010200 |
4 | 32232233220320113311 |
5 | 113041104043402041 |
6 | 2053005551311113 |
7 | 133063563256266 |
oct | 16565750702765 |
9 | 3522742342120 |
10 | 1012264044021 |
11 | 36033173276a |
12 | 14422521b499 |
13 | 745c104c219 |
14 | 36dcb15896d |
15 | 1b4e82921b6 |
hex | ebafa385f5 |
1012264044021 has 12 divisors (see below), whose sum is σ = 1464050723148. Its totient is φ = 673969673664.
The previous prime is 1012264044013. The next prime is 1012264044023. The reversal of 1012264044021 is 1204404622101.
1012264044021 is a `hidden beast` number, since 1 + 0 + 12 + 2 + 640 + 4 + 4 + 0 + 2 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 70073501796 + 942190542225 = 264714^2 + 970665^2 .
It is not a de Polignac number, because 1012264044021 - 23 = 1012264044013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012264044023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 72744520 + ... + 72758433.
It is an arithmetic number, because the mean of its divisors is an integer number (122004226929).
Almost surely, 21012264044021 is an apocalyptic number.
It is an amenable number.
1012264044021 is a deficient number, since it is larger than the sum of its proper divisors (451786679127).
1012264044021 is a wasteful number, since it uses less digits than its factorization.
1012264044021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145503732 (or 145503729 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 1012264044021 its reverse (1204404622101), we get a palindrome (2216668666122).
The spelling of 1012264044021 in words is "one trillion, twelve billion, two hundred sixty-four million, forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •