Base | Representation |
---|---|
bin | 110101011100… |
… | …100011001010 |
3 | 222100210220000 |
4 | 311130203022 |
5 | 12041314240 |
6 | 1220143430 |
7 | 230042100 |
oct | 65344312 |
9 | 28323800 |
10 | 14010570 |
11 | 79aa392 |
12 | 4837b76 |
13 | 2b971a2 |
14 | 1c09c70 |
15 | 136b430 |
hex | d5c8ca |
14010570 has 120 divisors (see below), whose sum is σ = 43947684. Its totient is φ = 3193344.
The previous prime is 14010551. The next prime is 14010587. The reversal of 14010570 is 7501041.
14010570 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 13816089 + 194481 = 3717^2 + 441^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 39514 + ... + 39866.
Almost surely, 214010570 is an apocalyptic number.
14010570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14010570, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21973842).
14010570 is an abundant number, since it is smaller than the sum of its proper divisors (29937114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14010570 is a wasteful number, since it uses less digits than its factorization.
14010570 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 386 (or 370 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 14010570 is about 3743.0695959333. The cubic root of 14010570 is about 241.0748664060.
The spelling of 14010570 in words is "fourteen million, ten thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •