Base | Representation |
---|---|
bin | 11110010101001011010… |
… | …10011111011101111010 |
3 | 10200122000000122202211120 |
4 | 33022211222133131322 |
5 | 114033321313341320 |
6 | 2114432401010110 |
7 | 135202506202455 |
oct | 17124552373572 |
9 | 3618000582746 |
10 | 1042161465210 |
11 | 371a83a83818 |
12 | 149b89923936 |
13 | 773770a9aa8 |
14 | 38625b0049c |
15 | 1c197da7440 |
hex | f2a5a9f77a |
1042161465210 has 64 divisors (see below), whose sum is σ = 2511971771904. Its totient is φ = 276712200000.
The previous prime is 1042161465187. The next prime is 1042161465229. The reversal of 1042161465210 is 125641612401.
It is a super-2 number, since 2×10421614652102 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24880785 + ... + 24922635.
It is an arithmetic number, because the mean of its divisors is an integer number (39249558936).
Almost surely, 21042161465210 is an apocalyptic number.
1042161465210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1042161465210 is an abundant number, since it is smaller than the sum of its proper divisors (1469810306694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1042161465210 is a wasteful number, since it uses less digits than its factorization.
1042161465210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45419.
The product of its (nonzero) digits is 11520, while the sum is 33.
The spelling of 1042161465210 in words is "one trillion, forty-two billion, one hundred sixty-one million, four hundred sixty-five thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •