Base | Representation |
---|---|
bin | 11010000101100011… |
… | …01001001111010100 |
3 | 1100011001021111020212 |
4 | 31002301221033110 |
5 | 212140313241431 |
6 | 10233420144552 |
7 | 1004030224130 |
oct | 150261511724 |
9 | 40131244225 |
10 | 14005212116 |
11 | 5a37639175 |
12 | 286a398158 |
13 | 142271537c |
14 | 96c0723c0 |
15 | 56e81272b |
hex | 342c693d4 |
14005212116 has 48 divisors (see below), whose sum is σ = 28986811392. Its totient is φ = 5793984000.
The previous prime is 14005212107. The next prime is 14005212127. The reversal of 14005212116 is 61121250041.
It is a super-2 number, since 2×140052121162 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14005212091 and 14005212100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 327950 + ... + 368186.
It is an arithmetic number, because the mean of its divisors is an integer number (603891904).
Almost surely, 214005212116 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14005212116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14493405696).
14005212116 is an abundant number, since it is smaller than the sum of its proper divisors (14981599276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14005212116 is a wasteful number, since it uses less digits than its factorization.
14005212116 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40680 (or 40678 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 14005212116 its reverse (61121250041), we get a palindrome (75126462157).
The spelling of 14005212116 in words is "fourteen billion, five million, two hundred twelve thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •