Base | Representation |
---|---|
bin | 1100100110100110011… |
… | …00111101110100011001 |
3 | 1112101202022101102112012 |
4 | 12103103030331310121 |
5 | 24043331232333423 |
6 | 530534052355305 |
7 | 43200065203505 |
oct | 6232314756431 |
9 | 1471668342465 |
10 | 433040121113 |
11 | 15771894a416 |
12 | 6bb14315b35 |
13 | 31ab27c4672 |
14 | 16d60299305 |
15 | b3e738e078 |
hex | 64d333dd19 |
433040121113 has 12 divisors (see below), whose sum is σ = 443455459668. Its totient is φ = 422864064000.
The previous prime is 433040121103. The next prime is 433040121161. The reversal of 433040121113 is 311121040334.
It can be written as a sum of positive squares in 2 ways, for example, as 36961216009 + 396078905104 = 192253^2 + 629348^2 .
It is not a de Polignac number, because 433040121113 - 24 = 433040121097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (433040121103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7992113 + ... + 8046113.
It is an arithmetic number, because the mean of its divisors is an integer number (36954621639).
Almost surely, 2433040121113 is an apocalyptic number.
433040121113 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
433040121113 is a deficient number, since it is larger than the sum of its proper divisors (10415338555).
433040121113 is an equidigital number, since it uses as much as digits as its factorization.
433040121113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58424 (or 58381 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 433040121113 its reverse (311121040334), we get a palindrome (744161161447).
The spelling of 433040121113 in words is "four hundred thirty-three billion, forty million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •