Base | Representation |
---|---|
bin | 100111111111110… |
… | …0011110001010100 |
3 | 10110112022210111010 |
4 | 1033333203301110 |
5 | 10222031433102 |
6 | 341101012220 |
7 | 45154223121 |
oct | 11777436124 |
9 | 3415283433 |
10 | 1342061652 |
11 | 629616868 |
12 | 315554070 |
13 | 185074029 |
14 | ca34d748 |
15 | 7cc4cd6c |
hex | 4ffe3c54 |
1342061652 has 24 divisors (see below), whose sum is σ = 3239460000. Its totient is φ = 431927776.
The previous prime is 1342061627. The next prime is 1342061653. The reversal of 1342061652 is 2561602431.
It is a super-2 number, since 2×13420616522 = 3602258955537938208, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1342061653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1927902 + ... + 1928597.
It is an arithmetic number, because the mean of its divisors is an integer number (134977500).
Almost surely, 21342061652 is an apocalyptic number.
1342061652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1342061652 is an abundant number, since it is smaller than the sum of its proper divisors (1897398348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1342061652 is a wasteful number, since it uses less digits than its factorization.
1342061652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3856535 (or 3856533 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 1342061652 is about 36634.1596327799. The cubic root of 1342061652 is about 1103.0388840339.
The spelling of 1342061652 in words is "one billion, three hundred forty-two million, sixty-one thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •