Base | Representation |
---|---|
bin | 11001000101000100… |
… | …00011000000100010 |
3 | 1021202100100220002200 |
4 | 30202202003000202 |
5 | 210033322034300 |
6 | 10104013354030 |
7 | 654441154215 |
oct | 144242030042 |
9 | 37670326080 |
10 | 13464252450 |
11 | 578a246170 |
12 | 2739198916 |
13 | 136761b9ac |
14 | 91a29777c |
15 | 53c0a8200 |
hex | 322883022 |
13464252450 has 432 divisors, whose sum is σ = 43467941088. Its totient is φ = 2951424000.
The previous prime is 13464252449. The next prime is 13464252469. The reversal of 13464252450 is 5425246431.
13464252450 is a `hidden beast` number, since 1 + 3 + 4 + 642 + 5 + 2 + 4 + 5 + 0 = 666.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 220725420 + ... + 220725480.
It is an arithmetic number, because the mean of its divisors is an integer number (100620234).
Almost surely, 213464252450 is an apocalyptic number.
13464252450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13464252450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21733970544).
13464252450 is an abundant number, since it is smaller than the sum of its proper divisors (30003688638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13464252450 is a wasteful number, since it uses less digits than its factorization.
13464252450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211 (or 142 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 36.
Adding to 13464252450 its reverse (5425246431), we get a palindrome (18889498881).
The spelling of 13464252450 in words is "thirteen billion, four hundred sixty-four million, two hundred fifty-two thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •