Base | Representation |
---|---|
bin | 1000111000010110100… |
… | …10101010110100111001 |
3 | 1002011121011220210210112 |
4 | 10130023102222310321 |
5 | 14444402310341101 |
6 | 352101544154105 |
7 | 31021313144402 |
oct | 4341322526471 |
9 | 1064534823715 |
10 | 305132121401 |
11 | 108451145048 |
12 | 4b178168935 |
13 | 22a0a169733 |
14 | 10aa89969a9 |
15 | 7e0d0126bb |
hex | 470b4aad39 |
305132121401 has 2 divisors, whose sum is σ = 305132121402. Its totient is φ = 305132121400.
The previous prime is 305132121391. The next prime is 305132121407. The reversal of 305132121401 is 104121231503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 276045160000 + 29086961401 = 525400^2 + 170549^2 .
It is a cyclic number.
It is not a de Polignac number, because 305132121401 - 238 = 30254214457 is a prime.
It is a super-2 number, since 2×3051321214012 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (305132121407) 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, 152566060700 + 152566060701.
It is an arithmetic number, because the mean of its divisors is an integer number (152566060701).
Almost surely, 2305132121401 is an apocalyptic number.
It is an amenable number.
305132121401 is a deficient number, since it is larger than the sum of its proper divisors (1).
305132121401 is an equidigital number, since it uses as much as digits as its factorization.
305132121401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 305132121401 its reverse (104121231503), we get a palindrome (409253352904).
The spelling of 305132121401 in words is "three hundred five billion, one hundred thirty-two million, one hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •