Base | Representation |
---|---|
bin | 11010001101010011… |
… | …01010100111000110 |
3 | 1100022120121201021010 |
4 | 31012221222213012 |
5 | 212303434320241 |
6 | 10244101503050 |
7 | 1005446656050 |
oct | 150651524706 |
9 | 40276551233 |
10 | 14070229446 |
11 | 5a703066a9 |
12 | 2888111a86 |
13 | 143302ac70 |
14 | 9769588d0 |
15 | 5753a6d16 |
hex | 346a6a9c6 |
14070229446 has 64 divisors (see below), whose sum is σ = 34662974976. Its totient is φ = 3707769600.
The previous prime is 14070229421. The next prime is 14070229487. The reversal of 14070229446 is 64492207041.
14070229446 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 694906 + ... + 714866.
It is an arithmetic number, because the mean of its divisors is an integer number (541608984).
Almost surely, 214070229446 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14070229446, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17331487488).
14070229446 is an abundant number, since it is smaller than the sum of its proper divisors (20592745530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14070229446 is a wasteful number, since it uses less digits than its factorization.
14070229446 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21277.
The product of its (nonzero) digits is 96768, while the sum is 39.
The spelling of 14070229446 in words is "fourteen billion, seventy million, two hundred twenty-nine thousand, four hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •