Base | Representation |
---|---|
bin | 11001001101000110… |
… | …11011010011111000 |
3 | 1021221001022202021221 |
4 | 30212203123103320 |
5 | 210203110114000 |
6 | 10114423441424 |
7 | 656220514315 |
oct | 144643332370 |
9 | 37831282257 |
10 | 13531723000 |
11 | 5814339854 |
12 | 27578b6274 |
13 | 13785b30b3 |
14 | 92521bd0c |
15 | 542e8461a |
hex | 3268db4f8 |
13531723000 has 128 divisors (see below), whose sum is σ = 32606945280. Its totient is φ = 5253494400.
The previous prime is 13531722961. The next prime is 13531723001. The reversal of 13531723000 is 32713531.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13531723001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5967867 + ... + 5970133.
It is an arithmetic number, because the mean of its divisors is an integer number (254741760).
Almost surely, 213531723000 is an apocalyptic number.
13531723000 is a gapful number since it is divisible by the number (10) 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 13531723000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16303472640).
13531723000 is an abundant number, since it is smaller than the sum of its proper divisors (19075222280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13531723000 is a wasteful number, since it uses less digits than its factorization.
13531723000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2462 (or 2448 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 25.
The spelling of 13531723000 in words is "thirteen billion, five hundred thirty-one million, seven hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •