Base | Representation |
---|---|
bin | 11001001000011010… |
… | …11110101100000000 |
3 | 1021211022100201011200 |
4 | 30210031132230000 |
5 | 210113024241412 |
6 | 10110501141200 |
7 | 655232431362 |
oct | 144415365400 |
9 | 37738321150 |
10 | 13492415232 |
11 | 57a413129a |
12 | 27466ba800 |
13 | 13703cc66a |
14 | 91dd08d32 |
15 | 53e7bc9dc |
hex | 32435eb00 |
13492415232 has 108 divisors (see below), whose sum is σ = 38989414464. Its totient is φ = 4487362560.
The previous prime is 13492415203. The next prime is 13492415249. The reversal of 13492415232 is 23251429431.
13492415232 is a `hidden beast` number, since 1 + 3 + 4 + 9 + 2 + 415 + 232 = 666.
It is a super-2 number, since 2×134924152322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1055793 + ... + 1068495.
Almost surely, 213492415232 is an apocalyptic number.
13492415232 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 13492415232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19494707232).
13492415232 is an abundant number, since it is smaller than the sum of its proper divisors (25496999232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13492415232 is a wasteful number, since it uses less digits than its factorization.
13492415232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13186 (or 13169 counting only the distinct ones).
The product of its digits is 51840, while the sum is 36.
The spelling of 13492415232 in words is "thirteen billion, four hundred ninety-two million, four hundred fifteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •