Base | Representation |
---|---|
bin | 11010100001111011… |
… | …00111000101010000 |
3 | 1100202122011001110020 |
4 | 31100331213011100 |
5 | 213132231330112 |
6 | 10313201503440 |
7 | 1012650312663 |
oct | 152075470520 |
9 | 40678131406 |
10 | 14243230032 |
11 | 6049a28599 |
12 | 2916041b80 |
13 | 145cb20c85 |
14 | 99190d6da |
15 | 58567b48c |
hex | 350f67150 |
14243230032 has 20 divisors (see below), whose sum is σ = 36795011040. Its totient is φ = 4747743328.
The previous prime is 14243230013. The next prime is 14243230039. The reversal of 14243230032 is 23003234241.
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 = 14243229984 and 14243230011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14243230039) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148366932 + ... + 148367027.
It is an arithmetic number, because the mean of its divisors is an integer number (1839750552).
Almost surely, 214243230032 is an apocalyptic number.
14243230032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14243230032 is an abundant number, since it is smaller than the sum of its proper divisors (22551781008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14243230032 is a wasteful number, since it uses less digits than its factorization.
14243230032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296733970 (or 296733964 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 14243230032 its reverse (23003234241), we get a palindrome (37246464273).
The spelling of 14243230032 in words is "fourteen billion, two hundred forty-three million, two hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •