Base | Representation |
---|---|
bin | 11110101101110111011… |
… | …00100011101001000000 |
3 | 10201220012202102021022100 |
4 | 33112323230203221000 |
5 | 114242442444212412 |
6 | 2124503523510400 |
7 | 136152123020226 |
oct | 17267354435100 |
9 | 3656182367270 |
10 | 1055416007232 |
11 | 377665904384 |
12 | 150668828400 |
13 | 786aa121672 |
14 | 391221a8b16 |
15 | 1c6c1838edc |
hex | f5bbb23a40 |
1055416007232 has 42 divisors (see below), whose sum is σ = 3025159425158. Its totient is φ = 351805335552.
The previous prime is 1055416007221. The next prime is 1055416007249. The reversal of 1055416007232 is 2327006145501.
1055416007232 is a `hidden beast` number, since 1 + 0 + 5 + 5 + 41 + 600 + 7 + 2 + 3 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1009832049216 + 45583958016 = 1004904^2 + 213504^2 .
It is a super-2 number, since 2×10554160072322 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 916159153 + ... + 916160304.
Almost surely, 21055416007232 is an apocalyptic number.
1055416007232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1055416007232 is an abundant number, since it is smaller than the sum of its proper divisors (1969743417926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055416007232 is a wasteful number, since it uses less digits than its factorization.
1055416007232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1832319475 (or 1832319462 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The spelling of 1055416007232 in words is "one trillion, fifty-five billion, four hundred sixteen million, seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •