Base | Representation |
---|---|
bin | 11010100000011000… |
… | …10010101000110000 |
3 | 1100201201211012110210 |
4 | 31100030102220300 |
5 | 213120424114412 |
6 | 10312020424120 |
7 | 1012432364460 |
oct | 152014225060 |
9 | 40651735423 |
10 | 14230301232 |
11 | 60426a7a34 |
12 | 2911848040 |
13 | 145a2452b4 |
14 | 98dd05ba0 |
15 | 58447583c |
hex | 350312a30 |
14230301232 has 160 divisors (see below), whose sum is σ = 43493343232. Its totient is φ = 3924329472.
The previous prime is 14230301203. The next prime is 14230301291. The reversal of 14230301232 is 23210303241.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 14230301199 and 14230301208.
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, 1574358 + ... + 1583370.
Almost surely, 214230301232 is an apocalyptic number.
14230301232 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 14230301232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21746671616).
14230301232 is an abundant number, since it is smaller than the sum of its proper divisors (29263042000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14230301232 is a wasteful number, since it uses less digits than its factorization.
14230301232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9195 (or 9189 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 14230301232 its reverse (23210303241), we get a palindrome (37440604473).
The spelling of 14230301232 in words is "fourteen billion, two hundred thirty million, three hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •