Base | Representation |
---|---|
bin | 101000011011101… |
… | …0111010001000100 |
3 | 10111112212000111022 |
4 | 1100313113101010 |
5 | 10234303044000 |
6 | 342342330312 |
7 | 45422451614 |
oct | 12067272104 |
9 | 3445760438 |
10 | 1356690500 |
11 | 6368a8720 |
12 | 31a429998 |
13 | 1880c6759 |
14 | cc27aa44 |
15 | 7e18c585 |
hex | 50dd7444 |
1356690500 has 96 divisors (see below), whose sum is σ = 3266984448. Its totient is φ = 488064000.
The previous prime is 1356690487. The next prime is 1356690521. The reversal of 1356690500 is 50966531.
It is a super-2 number, since 2×13566905002 = 3681218225580500000, which contains 22 as substring.
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, 532229 + ... + 534771.
It is an arithmetic number, because the mean of its divisors is an integer number (34031088).
Almost surely, 21356690500 is an apocalyptic number.
1356690500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1356690500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1633492224).
1356690500 is an abundant number, since it is smaller than the sum of its proper divisors (1910293948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1356690500 is a wasteful number, since it uses less digits than its factorization.
1356690500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2670 (or 2658 counting only the distinct ones).
The product of its (nonzero) digits is 24300, while the sum is 35.
The square root of 1356690500 is about 36833.2797887997. The cubic root of 1356690500 is about 1107.0322204493.
The spelling of 1356690500 in words is "one billion, three hundred fifty-six million, six hundred ninety thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •