Base | Representation |
---|---|
bin | 10010101111011011100001… |
… | …00110110010011100011011 |
3 | 12101220211122010201012220121 |
4 | 21113231300212302130123 |
5 | 20400204340201441103 |
6 | 223352324430534111 |
7 | 11452322160452212 |
oct | 1127556046623433 |
9 | 171824563635817 |
10 | 41212100421403 |
11 | 12149a5432192a |
12 | 4757221067337 |
13 | 19cc390a77522 |
14 | a26967ac2079 |
15 | 4b704bdb26bd |
hex | 257b709b271b |
41212100421403 has 4 divisors (see below), whose sum is σ = 43636341622680. Its totient is φ = 38787859220128.
The previous prime is 41212100421343. The next prime is 41212100421439. The reversal of 41212100421403 is 30412400121214.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 41212100421403 - 229 = 41211563550491 is a prime.
It is a super-2 number, since 2×412121004214032 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41212100421703) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1212120600613 + ... + 1212120600646.
It is an arithmetic number, because the mean of its divisors is an integer number (10909085405670).
Almost surely, 241212100421403 is an apocalyptic number.
41212100421403 is a deficient number, since it is larger than the sum of its proper divisors (2424241201277).
41212100421403 is a wasteful number, since it uses less digits than its factorization.
41212100421403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2424241201276.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 41212100421403 its reverse (30412400121214), we get a palindrome (71624500542617).
The spelling of 41212100421403 in words is "forty-one trillion, two hundred twelve billion, one hundred million, four hundred twenty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •