Base | Representation |
---|---|
bin | 1101101111111010000110… |
… | …10000100001011111001001 |
3 | 10222001021200211222220010221 |
4 | 12313331003100201133021 |
5 | 12430321002204421411 |
6 | 144145011135510041 |
7 | 6240201626022244 |
oct | 667750320413711 |
9 | 128037624886127 |
10 | 30233403201481 |
11 | 96a6a06a18997 |
12 | 3483529688321 |
13 | 13b3cc7bca5ac |
14 | 76743987825b |
15 | 376690a13071 |
hex | 1b7f434217c9 |
30233403201481 has 2 divisors, whose sum is σ = 30233403201482. Its totient is φ = 30233403201480.
The previous prime is 30233403201409. The next prime is 30233403201509. The reversal of 30233403201481 is 18410230433203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20476901069881 + 9756502131600 = 4525141^2 + 3123540^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30233403201481 is a prime.
It is a super-2 number, since 2×302334032014812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30233403201401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15116701600740 + 15116701600741.
It is an arithmetic number, because the mean of its divisors is an integer number (15116701600741).
Almost surely, 230233403201481 is an apocalyptic number.
It is an amenable number.
30233403201481 is a deficient number, since it is larger than the sum of its proper divisors (1).
30233403201481 is an equidigital number, since it uses as much as digits as its factorization.
30233403201481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41472, while the sum is 34.
Adding to 30233403201481 its reverse (18410230433203), we get a palindrome (48643633634684).
The spelling of 30233403201481 in words is "thirty trillion, two hundred thirty-three billion, four hundred three million, two hundred one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •