Base | Representation |
---|---|
bin | 11001000101001010… |
… | …11000010100001000 |
3 | 1021202102000021121000 |
4 | 30202211120110020 |
5 | 210034033014102 |
6 | 10104044215000 |
7 | 654451453362 |
oct | 144245302410 |
9 | 37672007530 |
10 | 13465126152 |
11 | 578a792635 |
12 | 273953a460 |
13 | 136786658a |
14 | 91a443d32 |
15 | 53c1cc01c |
hex | 322958508 |
13465126152 has 128 divisors (see below), whose sum is σ = 38211264000. Its totient is φ = 4391861760.
The previous prime is 13465126123. The next prime is 13465126163. The reversal of 13465126152 is 25162156431.
13465126152 is a `hidden beast` number, since 1 + 34 + 6 + 5 + 1 + 2 + 615 + 2 = 666.
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 31 ways as a sum of consecutive naturals, for example, 4932724 + ... + 4935452.
It is an arithmetic number, because the mean of its divisors is an integer number (298525500).
Almost surely, 213465126152 is an apocalyptic number.
13465126152 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 13465126152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19105632000).
13465126152 is an abundant number, since it is smaller than the sum of its proper divisors (24746137848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13465126152 is a wasteful number, since it uses less digits than its factorization.
13465126152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3228 (or 3218 counting only the distinct ones).
The product of its digits is 43200, while the sum is 36.
The spelling of 13465126152 in words is "thirteen billion, four hundred sixty-five million, one hundred twenty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •