Base | Representation |
---|---|
bin | 10111111101010… |
… | …011011110110001 |
3 | 1001000100000000002 |
4 | 113331103132301 |
5 | 1310344242140 |
6 | 103515035345 |
7 | 12650326550 |
oct | 2775233661 |
9 | 1030300002 |
10 | 401946545 |
11 | 196985430 |
12 | b273bb55 |
13 | 653735c0 |
14 | 3b54dd97 |
15 | 2544a415 |
hex | 17f537b1 |
401946545 has 32 divisors (see below), whose sum is σ = 647619840. Its totient is φ = 231287040.
The previous prime is 401946529. The next prime is 401946553. The reversal of 401946545 is 545649104.
It is not a de Polignac number, because 401946545 - 24 = 401946529 is a prime.
It is a super-2 number, since 2×4019465452 = 323122050074874050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 401946499 and 401946508.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35150 + ... + 45159.
It is an arithmetic number, because the mean of its divisors is an integer number (20238120).
Almost surely, 2401946545 is an apocalyptic number.
It is an amenable number.
401946545 is a deficient number, since it is larger than the sum of its proper divisors (245673295).
401946545 is a wasteful number, since it uses less digits than its factorization.
401946545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80345.
The product of its (nonzero) digits is 86400, while the sum is 38.
The square root of 401946545 is about 20048.6045649068. The cubic root of 401946545 is about 737.9995550608. Note that the first 3 decimals are identical.
The spelling of 401946545 in words is "four hundred one million, nine hundred forty-six thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •