Base | Representation |
---|---|
bin | 11101011101011100101… |
… | …10001000001110111000 |
3 | 10120202202220120021221122 |
4 | 32232232112020032320 |
5 | 113041033020213112 |
6 | 2053003454324412 |
7 | 133063211006363 |
oct | 16565626101670 |
9 | 3522686507848 |
10 | 1012242351032 |
11 | 360320466480 |
12 | 144219ab9708 |
13 | 745b96c5333 |
14 | 36dc830d0da |
15 | 1b4e6409872 |
hex | ebae5883b8 |
1012242351032 has 32 divisors (see below), whose sum is σ = 2070910800000. Its totient is φ = 460017919200.
The previous prime is 1012242351031. The next prime is 1012242351041. The reversal of 1012242351032 is 2301532422101.
It is a super-2 number, since 2×10122423510322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012242350992 and 1012242351010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012242351031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 710594 + ... + 1590417.
It is an arithmetic number, because the mean of its divisors is an integer number (64715962500).
Almost surely, 21012242351032 is an apocalyptic number.
It is an amenable number.
1012242351032 is an abundant number, since it is smaller than the sum of its proper divisors (1058668448968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012242351032 is a wasteful number, since it uses less digits than its factorization.
1012242351032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2306027 (or 2306023 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 1012242351032 its reverse (2301532422101), we get a palindrome (3313774773133).
The spelling of 1012242351032 in words is "one trillion, twelve billion, two hundred forty-two million, three hundred fifty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •