Base | Representation |
---|---|
bin | 11101011001111001111… |
… | …10110101101000100100 |
3 | 10120120212100202012020110 |
4 | 32230330332311220210 |
5 | 113023134121421012 |
6 | 2052051033333020 |
7 | 132665114605341 |
oct | 16547476655044 |
9 | 3516770665213 |
10 | 1010340420132 |
11 | 35a53491165a |
12 | 143988b67170 |
13 | 74375666934 |
14 | 36c878a17c8 |
15 | 1b43446973c |
hex | eb3cfb5a24 |
1010340420132 has 24 divisors (see below), whose sum is σ = 2357506228000. Its totient is φ = 336773676096.
The previous prime is 1010340420083. The next prime is 1010340420137. The reversal of 1010340420132 is 2310240430101.
It is a junction number, because it is equal to n+sod(n) for n = 1010340420099 and 1010340420108.
It is not an unprimeable number, because it can be changed into a prime (1010340420137) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 134257 + ... + 1427832.
Almost surely, 21010340420132 is an apocalyptic number.
1010340420132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010340420132 is an abundant number, since it is smaller than the sum of its proper divisors (1347165807868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010340420132 is a wasteful number, since it uses less digits than its factorization.
1010340420132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1615995 (or 1615993 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1010340420132 its reverse (2310240430101), we get a palindrome (3320580850233).
The spelling of 1010340420132 in words is "one trillion, ten billion, three hundred forty million, four hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •