Base | Representation |
---|---|
bin | 11001111111010110… |
… | …00011000011101100 |
3 | 1100000102022112010020 |
4 | 30333223003003230 |
5 | 212034001314322 |
6 | 10224320242140 |
7 | 1002525554100 |
oct | 147753030354 |
9 | 40012275106 |
10 | 13953151212 |
11 | 5a10210030 |
12 | 2854a70350 |
13 | 14149b7bc0 |
14 | 96519d900 |
15 | 569e7c05c |
hex | 33fac30ec |
13953151212 has 576 divisors, whose sum is σ = 47259168768. Its totient is φ = 3144960000.
The previous prime is 13953151151. The next prime is 13953151229. The reversal of 13953151212 is 21215135931.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
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 191 ways as a sum of consecutive naturals, for example, 138149962 + ... + 138150062.
It is an arithmetic number, because the mean of its divisors is an integer number (82047168).
Almost surely, 213953151212 is an apocalyptic number.
13953151212 is a gapful number since it is divisible by the number (12) 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 13953151212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23629584384).
13953151212 is an abundant number, since it is smaller than the sum of its proper divisors (33306017556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13953151212 is a wasteful number, since it uses less digits than its factorization.
13953151212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230 (or 221 counting only the distinct ones).
The product of its digits is 8100, while the sum is 33.
The spelling of 13953151212 in words is "thirteen billion, nine hundred fifty-three million, one hundred fifty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •