Base | Representation |
---|---|
bin | 1011111111110101101… |
… | …00101101000001110001 |
3 | 1110102001000111101220210 |
4 | 11333322310231001301 |
5 | 23223221340404131 |
6 | 513213103454333 |
7 | 41532305203500 |
oct | 5777264550161 |
9 | 1412030441823 |
10 | 412230013041 |
11 | 14990a1061a0 |
12 | 67a86bb73a9 |
13 | 2cb47338052 |
14 | 15d48576837 |
15 | aaca451146 |
hex | 5ffad2d071 |
412230013041 has 24 divisors (see below), whose sum is σ = 697502362464. Its totient is φ = 214145460480.
The previous prime is 412230013031. The next prime is 412230013079. The reversal of 412230013041 is 140310032214.
It is not a de Polignac number, because 412230013041 - 25 = 412230013009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 412230012999 and 412230013017.
It is not an unprimeable number, because it can be changed into a prime (412230013031) 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 23 ways as a sum of consecutive naturals, for example, 127465920 + ... + 127469153.
It is an arithmetic number, because the mean of its divisors is an integer number (29062598436).
Almost surely, 2412230013041 is an apocalyptic number.
It is an amenable number.
412230013041 is a deficient number, since it is larger than the sum of its proper divisors (285272349423).
412230013041 is a wasteful number, since it uses less digits than its factorization.
412230013041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254935101 (or 254935094 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 412230013041 its reverse (140310032214), we get a palindrome (552540045255).
The spelling of 412230013041 in words is "four hundred twelve billion, two hundred thirty million, thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •