Base | Representation |
---|---|
bin | 10010111010011101… |
… | …11110110100111000 |
3 | 222012122210220121120 |
4 | 21131032332310320 |
5 | 131243430034112 |
6 | 4355330305240 |
7 | 506425535355 |
oct | 113516766470 |
9 | 28178726546 |
10 | 10154143032 |
11 | 4340826a50 |
12 | 1b74728220 |
13 | c5a90a077 |
14 | 6c480962c |
15 | 3e66a9e8c |
hex | 25d3bed38 |
10154143032 has 32 divisors (see below), whose sum is σ = 27693118080. Its totient is φ = 3077012960.
The previous prime is 10154143019. The next prime is 10154143033. The reversal of 10154143032 is 23034145101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 10154142993 and 10154143011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10154143033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19231068 + ... + 19231595.
It is an arithmetic number, because the mean of its divisors is an integer number (865409940).
Almost surely, 210154143032 is an apocalyptic number.
10154143032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10154143032 is an abundant number, since it is smaller than the sum of its proper divisors (17538975048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10154143032 is a wasteful number, since it uses less digits than its factorization.
10154143032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38462683 (or 38462679 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 10154143032 its reverse (23034145101), we get a palindrome (33188288133).
The spelling of 10154143032 in words is "ten billion, one hundred fifty-four million, one hundred forty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •