Base | Representation |
---|---|
bin | 11101011011001100011… |
… | …01110100011010000010 |
3 | 10120122122120110220211001 |
4 | 32231212031310122002 |
5 | 113031043221304442 |
6 | 2052243425042214 |
7 | 133021215005461 |
oct | 16554615643202 |
9 | 3518576426731 |
10 | 1011032213122 |
11 | 35a85a3659a8 |
12 | 143b4078636a |
13 | 74455a915b9 |
14 | 36d117009d8 |
15 | 1b47506a2b7 |
hex | eb66374682 |
1011032213122 has 4 divisors (see below), whose sum is σ = 1516548319686. Its totient is φ = 505516106560.
The previous prime is 1011032213047. The next prime is 1011032213171. The reversal of 1011032213122 is 2213122301101.
1011032213122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 514417438441 + 496614774681 = 717229^2 + 704709^2 .
It is a super-3 number, since 3×10110322131223 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1011032213122.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252758053279 + ... + 252758053282.
Almost surely, 21011032213122 is an apocalyptic number.
1011032213122 is a deficient number, since it is larger than the sum of its proper divisors (505516106564).
1011032213122 is an equidigital number, since it uses as much as digits as its factorization.
1011032213122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 505516106563.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1011032213122 its reverse (2213122301101), we get a palindrome (3224154514223).
The spelling of 1011032213122 in words is "one trillion, eleven billion, thirty-two million, two hundred thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •