Base | Representation |
---|---|
bin | 101000000011000101… |
… | …011010101000010001 |
3 | 11002222211202200202012 |
4 | 220003011122220101 |
5 | 1201031331040101 |
6 | 31430553432305 |
7 | 3051421035155 |
oct | 500305325021 |
9 | 132884680665 |
10 | 43001424401 |
11 | 17267201681 |
12 | 840110b695 |
13 | 4093b45230 |
14 | 211d065065 |
15 | 11ba25cbbb |
hex | a0315aa11 |
43001424401 has 8 divisors (see below), whose sum is σ = 49033298664. Its totient is φ = 37358703360.
The previous prime is 43001424331. The next prime is 43001424419. The reversal of 43001424401 is 10442410034.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 214915600 + 42786508801 = 14660^2 + 206849^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 43001424401 - 234 = 25821555217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (43001424421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97288070 + ... + 97288511.
It is an arithmetic number, because the mean of its divisors is an integer number (6129162333).
Almost surely, 243001424401 is an apocalyptic number.
It is an amenable number.
43001424401 is a deficient number, since it is larger than the sum of its proper divisors (6031874263).
43001424401 is a wasteful number, since it uses less digits than its factorization.
43001424401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194576611.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 43001424401 its reverse (10442410034), we get a palindrome (53443834435).
The spelling of 43001424401 in words is "forty-three billion, one million, four hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •