Base | Representation |
---|---|
bin | 11011001000111010… |
… | …10011110001110000 |
3 | 1101121102121021020212 |
4 | 31210131103301300 |
5 | 214314444303142 |
6 | 10405444123252 |
7 | 1024031364125 |
oct | 154435236160 |
9 | 41542537225 |
10 | 14570306672 |
11 | 61a7616069 |
12 | 29a7696528 |
13 | 14b280c24c |
14 | 9c313074c |
15 | 5a4237d82 |
hex | 364753c70 |
14570306672 has 20 divisors (see below), whose sum is σ = 29203417320. Its totient is φ = 7033940928.
The previous prime is 14570306633. The next prime is 14570306687. The reversal of 14570306672 is 27660307541.
14570306672 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×145703066722 (a number of 21 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 15700298 + ... + 15701225.
It is an arithmetic number, because the mean of its divisors is an integer number (1460170866).
Almost surely, 214570306672 is an apocalyptic number.
It is an amenable number.
14570306672 is an abundant number, since it is smaller than the sum of its proper divisors (14633110648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14570306672 is a wasteful number, since it uses less digits than its factorization.
14570306672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31401560 (or 31401554 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 41.
The spelling of 14570306672 in words is "fourteen billion, five hundred seventy million, three hundred six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •