Base | Representation |
---|---|
bin | 11010010111001100… |
… | …11001101111100000 |
3 | 1100112100212002202211 |
4 | 31023212121233200 |
5 | 212441213310000 |
6 | 10300225251504 |
7 | 1010505503455 |
oct | 151346315740 |
9 | 40470762684 |
10 | 14153260000 |
11 | 60031677a0 |
12 | 28aba93b94 |
13 | 14472ac879 |
14 | 9839ad82c |
15 | 57c8087ba |
hex | 34b999be0 |
14153260000 has 120 divisors (see below), whose sum is σ = 37985109624. Its totient is φ = 5146560000.
The previous prime is 14153259949. The next prime is 14153260007. The reversal of 14153260000 is 6235141.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14153260007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 187834 + ... + 252166.
Almost surely, 214153260000 is an apocalyptic number.
14153260000 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 14153260000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18992554812).
14153260000 is an abundant number, since it is smaller than the sum of its proper divisors (23831849624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14153260000 is an equidigital number, since it uses as much as digits as its factorization.
14153260000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64374 (or 64351 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 14153260000 its reverse (6235141), we get a palindrome (14159495141).
The spelling of 14153260000 in words is "fourteen billion, one hundred fifty-three million, two hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •