Base | Representation |
---|---|
bin | 110010110111001101001… |
… | …011001100100100001100 |
3 | 110101010212000210022221000 |
4 | 302313031023030210030 |
5 | 424231233133112410 |
6 | 11233410200140300 |
7 | 510344366354640 |
oct | 62671513144414 |
9 | 13333760708830 |
10 | 3495250675980 |
11 | 11283669817a8 |
12 | 4854a0467690 |
13 | 1c47a6a3a37b |
14 | c125746cc20 |
15 | 60dbd439dc0 |
hex | 32dcd2cc90c |
3495250675980 has 192 divisors, whose sum is σ = 13158591022080. Its totient is φ = 751919459328.
The previous prime is 3495250675957. The next prime is 3495250675981. The reversal of 3495250675980 is 895760525943.
3495250675980 is a `hidden beast` number, since 3 + 4 + 9 + 52 + 506 + 75 + 9 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (3495250675981) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27131902 + ... + 27260421.
It is an arithmetic number, because the mean of its divisors is an integer number (68534328240).
Almost surely, 23495250675980 is an apocalyptic number.
3495250675980 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3495250675980 is an abundant number, since it is smaller than the sum of its proper divisors (9663340346100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3495250675980 is a wasteful number, since it uses less digits than its factorization.
3495250675980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54392365 (or 54392357 counting only the distinct ones).
The product of its (nonzero) digits is 81648000, while the sum is 63.
The spelling of 3495250675980 in words is "three trillion, four hundred ninety-five billion, two hundred fifty million, six hundred seventy-five thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •