Base | Representation |
---|---|
bin | 1011101101000110101… |
… | …11101100101110011001 |
3 | 1102110002010011221202221 |
4 | 11312203113230232121 |
5 | 23042122222412431 |
6 | 504431120024041 |
7 | 41025134611531 |
oct | 5664327545631 |
9 | 1373063157687 |
10 | 402172857241 |
11 | 145619103191 |
12 | 65b3aa62021 |
13 | 2bc0385839c |
14 | 156729b64c1 |
15 | a6dc553111 |
hex | 5da35ecb99 |
402172857241 has 27 divisors (see below), whose sum is σ = 418131614613. Its totient is φ = 386818943160.
The previous prime is 402172857227. The next prime is 402172857259. The reversal of 402172857241 is 142758271204.
The square root of 402172857241 is 634171.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 402172857241 - 25 = 402172857209 is a prime.
It is a super-2 number, since 2×4021728572412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (402172857221) by changing a digit.
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 26 ways as a sum of consecutive naturals, for example, 3070021746 + ... + 3070021876.
Almost surely, 2402172857241 is an apocalyptic number.
402172857241 is the 634171-st square number.
402172857241 is the 317086-th centered octagonal number.
It is an amenable number.
402172857241 is a deficient number, since it is larger than the sum of its proper divisors (15958757372).
402172857241 is an frugal number, since it uses more digits than its factorization.
402172857241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562 (or 281 counting only the distinct ones).
The product of its (nonzero) digits is 250880, while the sum is 43.
The spelling of 402172857241 in words is "four hundred two billion, one hundred seventy-two million, eight hundred fifty-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •