Base | Representation |
---|---|
bin | 111100011111101100010… |
… | …011001000011011100011 |
3 | 112201102110021010000122222 |
4 | 330133230103020123203 |
5 | 1021102420120012400 |
6 | 12501442412421255 |
7 | 606230144243240 |
oct | 74375423103343 |
9 | 15642407100588 |
10 | 4157197813475 |
11 | 136306a8735a3 |
12 | 57183917782b |
13 | 242039650b05 |
14 | 1052d0a205c7 |
15 | 7321192a185 |
hex | 3c7ec4c86e3 |
4157197813475 has 12 divisors (see below), whose sum is σ = 5891343187344. Its totient is φ = 2850649929120.
The previous prime is 4157197813387. The next prime is 4157197813481. The reversal of 4157197813475 is 5743187917514.
It is a happy number.
4157197813475 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4157197813475 - 222 = 4157193619171 is a prime.
It is a super-2 number, since 2×41571978134752 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11877707864 + ... + 11877708213.
It is an arithmetic number, because the mean of its divisors is an integer number (490945265612).
Almost surely, 24157197813475 is an apocalyptic number.
4157197813475 is a deficient number, since it is larger than the sum of its proper divisors (1734145373869).
4157197813475 is a wasteful number, since it uses less digits than its factorization.
4157197813475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23755416094 (or 23755416089 counting only the distinct ones).
The product of its digits is 29635200, while the sum is 62.
The spelling of 4157197813475 in words is "four trillion, one hundred fifty-seven billion, one hundred ninety-seven million, eight hundred thirteen thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •