Base | Representation |
---|---|
bin | 1100110000110101011101… |
… | …0000000111111001100001 |
3 | 1211200112221101210220200002 |
4 | 3030031113100013321201 |
5 | 3314404313213003411 |
6 | 45502421030305345 |
7 | 2645600562614453 |
oct | 314152720077141 |
9 | 54615841726602 |
10 | 14033122000481 |
11 | 4520460587901 |
12 | 16a78681b8255 |
13 | 7aa419077bbc |
14 | 3672c739a2d3 |
15 | 195078b6933b |
hex | cc357407e61 |
14033122000481 has 2 divisors, whose sum is σ = 14033122000482. Its totient is φ = 14033122000480.
The previous prime is 14033122000411. The next prime is 14033122000483. The reversal of 14033122000481 is 18400022133041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13224561360481 + 808560640000 = 3636559^2 + 899200^2 .
It is a cyclic number.
It is not a de Polignac number, because 14033122000481 - 234 = 14015942131297 is a prime.
It is a super-2 number, since 2×140331220004812 (a number of 27 digits) contains 22 as substring.
Together with 14033122000483, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14033122000483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7016561000240 + 7016561000241.
It is an arithmetic number, because the mean of its divisors is an integer number (7016561000241).
Almost surely, 214033122000481 is an apocalyptic number.
It is an amenable number.
14033122000481 is a deficient number, since it is larger than the sum of its proper divisors (1).
14033122000481 is an equidigital number, since it uses as much as digits as its factorization.
14033122000481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 29.
The spelling of 14033122000481 in words is "fourteen trillion, thirty-three billion, one hundred twenty-two million, four hundred eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •