Base | Representation |
---|---|
bin | 11101011011100001111… |
… | …11111101101011000001 |
3 | 10120200010011220110201012 |
4 | 32231300333331223001 |
5 | 113031431030133213 |
6 | 2052313410450305 |
7 | 133025542534262 |
oct | 16556077755301 |
9 | 3520104813635 |
10 | 1011213130433 |
11 | 35a9424a4840 |
12 | 143b91293995 |
13 | 744843c6b6c |
14 | 36d2b756969 |
15 | 1b485da54a8 |
hex | eb70ffdac1 |
1011213130433 has 16 divisors (see below), whose sum is σ = 1161239928000. Its totient is φ = 870872575680.
The previous prime is 1011213130427. The next prime is 1011213130441. The reversal of 1011213130433 is 3340313121101.
It is not a de Polignac number, because 1011213130433 - 232 = 1006918163137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011213130399 and 1011213130408.
It is not an unprimeable number, because it can be changed into a prime (1011213135433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8470643 + ... + 8589191.
It is an arithmetic number, because the mean of its divisors is an integer number (72577495500).
Almost surely, 21011213130433 is an apocalyptic number.
It is an amenable number.
1011213130433 is a deficient number, since it is larger than the sum of its proper divisors (150026797567).
1011213130433 is a wasteful number, since it uses less digits than its factorization.
1011213130433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159392.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1011213130433 its reverse (3340313121101), we get a palindrome (4351526251534).
The spelling of 1011213130433 in words is "one trillion, eleven billion, two hundred thirteen million, one hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •