Base | Representation |
---|---|
bin | 1011111010100101100… |
… | …11000111110000100011 |
3 | 1110010202120002000121200 |
4 | 11331102303013300203 |
5 | 23201433210312310 |
6 | 512025243052243 |
7 | 41402405205321 |
oct | 5752263076043 |
9 | 1403676060550 |
10 | 409411025955 |
11 | 1486a293a4a8 |
12 | 6741ab11083 |
13 | 2c7b82c0759 |
14 | 15b5c00cd11 |
15 | a9b2c159c0 |
hex | 5f52cc7c23 |
409411025955 has 24 divisors (see below), whose sum is σ = 712615026240. Its totient is φ = 217438932480.
The previous prime is 409411025953. The next prime is 409411025983. The reversal of 409411025955 is 559520114904.
409411025955 is a `hidden beast` number, since 4 + 0 + 9 + 41 + 10 + 2 + 595 + 5 = 666.
It is not a de Polignac number, because 409411025955 - 21 = 409411025953 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 409411025955.
It is not an unprimeable number, because it can be changed into a prime (409411025951) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19022766 + ... + 19044275.
It is an arithmetic number, because the mean of its divisors is an integer number (29692292760).
Almost surely, 2409411025955 is an apocalyptic number.
409411025955 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
409411025955 is a deficient number, since it is larger than the sum of its proper divisors (303204000285).
409411025955 is a wasteful number, since it uses less digits than its factorization.
409411025955 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38067291 (or 38067288 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 45.
The spelling of 409411025955 in words is "four hundred nine billion, four hundred eleven million, twenty-five thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •