Base | Representation |
---|---|
bin | 11101100000110000101… |
… | …11010000110111001011 |
3 | 10120221100212110201111002 |
4 | 32300120113100313023 |
5 | 113103203341032134 |
6 | 2053500153525215 |
7 | 133155246366332 |
oct | 16603027206713 |
9 | 3527325421432 |
10 | 1014021033419 |
11 | 36105348a919 |
12 | 14463571380b |
13 | 74811060314 |
14 | 37116636d19 |
15 | 1b59c65187e |
hex | ec185d0dcb |
1014021033419 has 2 divisors, whose sum is σ = 1014021033420. Its totient is φ = 1014021033418.
The previous prime is 1014021033409. The next prime is 1014021033521. The reversal of 1014021033419 is 9143301204101.
It is a happy number.
1014021033419 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (9143301204101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1014021033419 - 28 = 1014021033163 is a prime.
It is a super-2 number, since 2×10140210334192 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1014021033391 and 1014021033400.
It is not a weakly prime, because it can be changed into another prime (1014021033409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507010516709 + 507010516710.
It is an arithmetic number, because the mean of its divisors is an integer number (507010516710).
Almost surely, 21014021033419 is an apocalyptic number.
1014021033419 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014021033419 is an equidigital number, since it uses as much as digits as its factorization.
1014021033419 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 1014021033419 in words is "one trillion, fourteen billion, twenty-one million, thirty-three thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •