Base | Representation |
---|---|
bin | 1101111000100010100100… |
… | …11100001100011000111111 |
3 | 11000002122021221021002020210 |
4 | 12330101102130030120333 |
5 | 13000200430212144323 |
6 | 144533143203043503 |
7 | 6300502060603404 |
oct | 674212234143077 |
9 | 130078257232223 |
10 | 30530010662463 |
11 | 9800783115434 |
12 | 3510b06970593 |
13 | 1405c76c16360 |
14 | 7779361d22ab |
15 | 37e250440293 |
hex | 1bc45270c63f |
30530010662463 has 16 divisors (see below), whose sum is σ = 43918106589056. Its totient is φ = 18753352057440.
The previous prime is 30530010662461. The next prime is 30530010662467. The reversal of 30530010662463 is 36426601003503.
It is not a de Polignac number, because 30530010662463 - 21 = 30530010662461 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30530010662461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 715536973 + ... + 715579638.
It is an arithmetic number, because the mean of its divisors is an integer number (2744881661816).
Almost surely, 230530010662463 is an apocalyptic number.
30530010662463 is a deficient number, since it is larger than the sum of its proper divisors (13388095926593).
30530010662463 is a wasteful number, since it uses less digits than its factorization.
30530010662463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1431117174.
The product of its (nonzero) digits is 233280, while the sum is 39.
Adding to 30530010662463 its reverse (36426601003503), we get a palindrome (66956611665966).
The spelling of 30530010662463 in words is "thirty trillion, five hundred thirty billion, ten million, six hundred sixty-two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •