Base | Representation |
---|---|
bin | 11101011101000100110… |
… | …10010110111101010110 |
3 | 10120202020221211011220100 |
4 | 32232202122112331112 |
5 | 113040130241231314 |
6 | 2052531543114530 |
7 | 133055230124331 |
oct | 16564232267526 |
9 | 3522227734810 |
10 | 1012042133334 |
11 | 360228444a01 |
12 | 144182a42a46 |
13 | 74587092c1b |
14 | 36da98b1618 |
15 | 1b4d3a5ac09 |
hex | eba2696f56 |
1012042133334 has 24 divisors (see below), whose sum is σ = 2223641873232. Its totient is φ = 332596005840.
The previous prime is 1012042133257. The next prime is 1012042133351. The reversal of 1012042133334 is 4333312402101.
It is a happy number.
1012042133334 is a `hidden beast` number, since 101 + 204 + 21 + 3 + 3 + 334 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 1012042133298 and 1012042133307.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 395946349 + ... + 395948904.
It is an arithmetic number, because the mean of its divisors is an integer number (92651744718).
Almost surely, 21012042133334 is an apocalyptic number.
1012042133334 is an abundant number, since it is smaller than the sum of its proper divisors (1211599739898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012042133334 is a wasteful number, since it uses less digits than its factorization.
1012042133334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 791895332 (or 791895329 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1012042133334 its reverse (4333312402101), we get a palindrome (5345354535435).
The spelling of 1012042133334 in words is "one trillion, twelve billion, forty-two million, one hundred thirty-three thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •