Base | Representation |
---|---|
bin | 100000101101111010… |
… | …111001010011111110 |
3 | 10100200021120122011210 |
4 | 200231322321103332 |
5 | 1033421304332230 |
6 | 24045533025250 |
7 | 2352362236530 |
oct | 405572712376 |
9 | 110607518153 |
10 | 35130152190 |
11 | 13998067331 |
12 | 6985025226 |
13 | 340b193803 |
14 | 19b3909850 |
15 | da91ddeb0 |
hex | 82deb94fe |
35130152190 has 64 divisors (see below), whose sum is σ = 96558428160. Its totient is φ = 8012962560.
The previous prime is 35130152171. The next prime is 35130152191. The reversal of 35130152190 is 9125103153.
It is a super-2 number, since 2×351301521902 (a number of 22 digits) contains 22 as substring.
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 (35130152191) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 74031 + ... + 275210.
It is an arithmetic number, because the mean of its divisors is an integer number (1508725440).
Almost surely, 235130152190 is an apocalyptic number.
35130152190 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
35130152190 is an abundant number, since it is smaller than the sum of its proper divisors (61428275970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
35130152190 is a wasteful number, since it uses less digits than its factorization.
35130152190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349737.
The product of its (nonzero) digits is 4050, while the sum is 30.
The spelling of 35130152190 in words is "thirty-five billion, one hundred thirty million, one hundred fifty-two thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •