Base | Representation |
---|---|
bin | 11011001000111111… |
… | …01001110001001011 |
3 | 1101121110202111000001 |
4 | 31210133221301023 |
5 | 214320123433120 |
6 | 10405505223431 |
7 | 1024036533226 |
oct | 154437516113 |
9 | 41543674001 |
10 | 14570921035 |
11 | 61a79a5700 |
12 | 29a7931b77 |
13 | 14b2995a88 |
14 | 9c32505bd |
15 | 5a4309e0a |
hex | 3647e9c4b |
14570921035 has 12 divisors (see below), whose sum is σ = 19219166064. Its totient is φ = 10597033040.
The previous prime is 14570921023. The next prime is 14570921089. The reversal of 14570921035 is 53012907541.
It is not a de Polignac number, because 14570921035 - 25 = 14570921003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14570920985 and 14570921003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12041479 + ... + 12042688.
It is an arithmetic number, because the mean of its divisors is an integer number (1601597172).
Almost surely, 214570921035 is an apocalyptic number.
14570921035 is a deficient number, since it is larger than the sum of its proper divisors (4648245029).
14570921035 is a wasteful number, since it uses less digits than its factorization.
14570921035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24084194 (or 24084183 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 37.
The spelling of 14570921035 in words is "fourteen billion, five hundred seventy million, nine hundred twenty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •