Base | Representation |
---|---|
bin | 11101100010101001000… |
… | …110100001110010010101 |
3 | 21012001221111002121012221 |
4 | 131202221012201302111 |
5 | 231230031233440334 |
6 | 4152333013542341 |
7 | 266444551045054 |
oct | 35425106416225 |
9 | 7161844077187 |
10 | 2030061624469 |
11 | 712a4295522a |
12 | 2895336449b1 |
13 | 119584624948 |
14 | 7038117a39b |
15 | 37c1722a8b4 |
hex | 1d8a91a1c95 |
2030061624469 has 2 divisors, whose sum is σ = 2030061624470. Its totient is φ = 2030061624468.
The previous prime is 2030061624427. The next prime is 2030061624473. The reversal of 2030061624469 is 9644261600302.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1664383812100 + 365677812369 = 1290110^2 + 604713^2 .
It is a cyclic number.
It is not a de Polignac number, because 2030061624469 - 27 = 2030061624341 is a prime.
It is a super-2 number, since 2×20300616244692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2030061624869) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015030812234 + 1015030812235.
It is an arithmetic number, because the mean of its divisors is an integer number (1015030812235).
Almost surely, 22030061624469 is an apocalyptic number.
It is an amenable number.
2030061624469 is a deficient number, since it is larger than the sum of its proper divisors (1).
2030061624469 is an equidigital number, since it uses as much as digits as its factorization.
2030061624469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 373248, while the sum is 43.
The spelling of 2030061624469 in words is "two trillion, thirty billion, sixty-one million, six hundred twenty-four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •