Base | Representation |
---|---|
bin | 11110101111001100100… |
… | …01000110111110001010 |
3 | 10201222001112100122210000 |
4 | 33113212101012332022 |
5 | 114300423314412302 |
6 | 2125102440103430 |
7 | 136205614565613 |
oct | 17274621067612 |
9 | 3658045318700 |
10 | 1056130232202 |
11 | 3779a1a8a151 |
12 | 150827a64b76 |
13 | 787920a16a6 |
14 | 3918cda6c0a |
15 | 1c7143bb31c |
hex | f5e6446f8a |
1056130232202 has 20 divisors (see below), whose sum is σ = 2366514039186. Its totient is φ = 352043410680.
The previous prime is 1056130232117. The next prime is 1056130232251. The reversal of 1056130232202 is 2022320316501.
It is a happy number.
1056130232202 is a `hidden beast` number, since 1 + 0 + 5 + 613 + 0 + 23 + 2 + 20 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 883846297161 + 172283935041 = 940131^2 + 415071^2 .
It is a super-2 number, since 2×10561302322022 (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 an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3259661049 + ... + 3259661372.
Almost surely, 21056130232202 is an apocalyptic number.
1056130232202 is an abundant number, since it is smaller than the sum of its proper divisors (1310383806984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056130232202 is an equidigital number, since it uses as much as digits as its factorization.
1056130232202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6519322435 (or 6519322426 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 1056130232202 its reverse (2022320316501), we get a palindrome (3078450548703).
The spelling of 1056130232202 in words is "one trillion, fifty-six billion, one hundred thirty million, two hundred thirty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •