Base | Representation |
---|---|
bin | 1101101111111001011010… |
… | …00100101111001101010001 |
3 | 10222001020201220122202210211 |
4 | 12313330231010233031101 |
5 | 12430314221414410301 |
6 | 144144510202324121 |
7 | 6240156456333232 |
oct | 667745504571521 |
9 | 128036656582724 |
10 | 30233031013201 |
11 | 96a6835919375 |
12 | 3483444ab9641 |
13 | 13b3c68a75c43 |
14 | 767402273089 |
15 | 37666cee5051 |
hex | 1b7f2d12f351 |
30233031013201 has 2 divisors, whose sum is σ = 30233031013202. Its totient is φ = 30233031013200.
The previous prime is 30233031013189. The next prime is 30233031013223. The reversal of 30233031013201 is 10231013033203.
It is an a-pointer prime, because the next prime (30233031013223) can be obtained adding 30233031013201 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28638809122576 + 1594221890625 = 5351524^2 + 1262625^2 .
It is a cyclic number.
It is not a de Polignac number, because 30233031013201 - 239 = 29683275199313 is a prime.
It is not a weakly prime, because it can be changed into another prime (30233031013271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15116515506600 + 15116515506601.
It is an arithmetic number, because the mean of its divisors is an integer number (15116515506601).
Almost surely, 230233031013201 is an apocalyptic number.
It is an amenable number.
30233031013201 is a deficient number, since it is larger than the sum of its proper divisors (1).
30233031013201 is an equidigital number, since it uses as much as digits as its factorization.
30233031013201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 30233031013201 its reverse (10231013033203), we get a palindrome (40464044046404).
The spelling of 30233031013201 in words is "thirty trillion, two hundred thirty-three billion, thirty-one million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •