Base | Representation |
---|---|
bin | 11011010100111010… |
… | …01111110111110010 |
3 | 1101212102222200101120 |
4 | 31222131033313302 |
5 | 220021231011340 |
6 | 10423441243110 |
7 | 1026363023361 |
oct | 155235176762 |
9 | 41772880346 |
10 | 14670953970 |
11 | 6249409952 |
12 | 2a15333496 |
13 | 14ca61b56a |
14 | 9d264d7d8 |
15 | 5aceb94d0 |
hex | 36a74fdf2 |
14670953970 has 32 divisors (see below), whose sum is σ = 35558913600. Its totient is φ = 3873518400.
The previous prime is 14670953951. The next prime is 14670953977. The reversal of 14670953970 is 7935907641.
It is not an unprimeable number, because it can be changed into a prime (14670953977) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2417920 + ... + 2423979.
It is an arithmetic number, because the mean of its divisors is an integer number (1111216050).
Almost surely, 214670953970 is an apocalyptic number.
14670953970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14670953970 is an abundant number, since it is smaller than the sum of its proper divisors (20887959630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14670953970 is a wasteful number, since it uses less digits than its factorization.
14670953970 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4842010.
The product of its (nonzero) digits is 1428840, while the sum is 51.
The spelling of 14670953970 in words is "fourteen billion, six hundred seventy million, nine hundred fifty-three thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •