Base | Representation |
---|---|
bin | 10000111000100011010… |
… | …101101010010111101100 |
3 | 11002220202201001121011110 |
4 | 100320203111222113230 |
5 | 123002124404113202 |
6 | 2245000522152020 |
7 | 146552452466556 |
oct | 20704325522754 |
9 | 4086681047143 |
10 | 1160234051052 |
11 | 40806396907a |
12 | 168a40052610 |
13 | 85542b825bb |
14 | 402270844d6 |
15 | 202a8a3726c |
hex | 10e2356a5ec |
1160234051052 has 48 divisors (see below), whose sum is σ = 2737020593664. Its totient is φ = 382494840000.
The previous prime is 1160234051033. The next prime is 1160234051057. The reversal of 1160234051052 is 2501504320611.
It is a super-2 number, since 2×11602340510522 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1160234051057) 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, 578727 + ... + 1629537.
It is an arithmetic number, because the mean of its divisors is an integer number (57021262368).
Almost surely, 21160234051052 is an apocalyptic number.
1160234051052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1160234051052 is an abundant number, since it is smaller than the sum of its proper divisors (1576786542612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1160234051052 is a wasteful number, since it uses less digits than its factorization.
1160234051052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1051830 (or 1051828 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 1160234051052 its reverse (2501504320611), we get a palindrome (3661738371663).
The spelling of 1160234051052 in words is "one trillion, one hundred sixty billion, two hundred thirty-four million, fifty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •