Base | Representation |
---|---|
bin | 11001111111101110… |
… | …00010101000000100 |
3 | 1100000122020020211012 |
4 | 30333313002220010 |
5 | 212040302421142 |
6 | 10224511501352 |
7 | 1002564360131 |
oct | 147767025004 |
9 | 40018206735 |
10 | 13956295172 |
11 | 5a11a68146 |
12 | 2855b27858 |
13 | 1415548c31 |
14 | 96577b588 |
15 | 56a39d882 |
hex | 33fdc2a04 |
13956295172 has 24 divisors (see below), whose sum is σ = 25463059776. Its totient is φ = 6687259488.
The previous prime is 13956295159. The next prime is 13956295183. The reversal of 13956295172 is 27159265931.
13956295172 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 (50) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 13956295172.
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 7 ways as a sum of consecutive naturals, for example, 756368 + ... + 774599.
It is an arithmetic number, because the mean of its divisors is an integer number (1060960824).
Almost surely, 213956295172 is an apocalyptic number.
It is an amenable number.
13956295172 is a deficient number, since it is larger than the sum of its proper divisors (11506764604).
13956295172 is a wasteful number, since it uses less digits than its factorization.
13956295172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1531067 (or 1531065 counting only the distinct ones).
The product of its digits is 1020600, while the sum is 50.
The spelling of 13956295172 in words is "thirteen billion, nine hundred fifty-six million, two hundred ninety-five thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •