Base | Representation |
---|---|
bin | 111111100101111110… |
… | …1111100100110011110 |
3 | 111001111112000121101010 |
4 | 1333023331330212132 |
5 | 4214141344000110 |
6 | 142423151200050 |
7 | 12603142563405 |
oct | 1771375744636 |
9 | 431445017333 |
10 | 136566000030 |
11 | 52a0aa46139 |
12 | 22573816026 |
13 | cb552c3655 |
14 | 687753063c |
15 | 3844500020 |
hex | 1fcbf7c99e |
136566000030 has 32 divisors (see below), whose sum is σ = 328255804800. Its totient is φ = 36362332832.
The previous prime is 136565999963. The next prime is 136566000031. The reversal of 136566000030 is 30000665631.
136566000030 is digitally balanced in base 7, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136566000031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3434100 + ... + 3473639.
It is an arithmetic number, because the mean of its divisors is an integer number (10257993900).
Almost surely, 2136566000030 is an apocalyptic number.
136566000030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136566000030 is an abundant number, since it is smaller than the sum of its proper divisors (191689804770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136566000030 is a wasteful number, since it uses less digits than its factorization.
136566000030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6908408.
The product of its (nonzero) digits is 9720, while the sum is 30.
Adding to 136566000030 its reverse (30000665631), we get a palindrome (166566665661).
The spelling of 136566000030 in words is "one hundred thirty-six billion, five hundred sixty-six million, thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •