Base | Representation |
---|---|
bin | 11001111111101110… |
… | …00010101000000010 |
3 | 1100000122020020211010 |
4 | 30333313002220002 |
5 | 212040302421140 |
6 | 10224511501350 |
7 | 1002564360126 |
oct | 147767025002 |
9 | 40018206733 |
10 | 13956295170 |
11 | 5a11a68144 |
12 | 2855b27856 |
13 | 1415548c2c |
14 | 96577b586 |
15 | 56a39d880 |
hex | 33fdc2a02 |
13956295170 has 32 divisors (see below), whose sum is σ = 34575598080. Its totient is φ = 3601624320.
The previous prime is 13956295159. The next prime is 13956295183. The reversal of 13956295170 is 7159265931.
13956295170 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon 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 15 ways as a sum of consecutive naturals, for example, 7502455 + ... + 7504314.
It is an arithmetic number, because the mean of its divisors is an integer number (1080487440).
Almost surely, 213956295170 is an apocalyptic number.
13956295170 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13956295170 is an abundant number, since it is smaller than the sum of its proper divisors (20619302910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13956295170 is a wasteful number, since it uses less digits than its factorization.
13956295170 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15006810.
The product of its (nonzero) digits is 510300, while the sum is 48.
The spelling of 13956295170 in words is "thirteen billion, nine hundred fifty-six million, two hundred ninety-five thousand, one hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •