Base | Representation |
---|---|
bin | 1101110000100011010101… |
… | …11010010100001101011011 |
3 | 10222010101211211111200120212 |
4 | 12320101222322110031123 |
5 | 12431201323041230201 |
6 | 144203112115041335 |
7 | 6241614365552201 |
oct | 670215272241533 |
9 | 128111754450525 |
10 | 30255543305051 |
11 | 9705338487449 |
12 | 34878882a024b |
13 | 13b6115a94aac |
14 | 76853a089071 |
15 | 3770395b8abb |
hex | 1b846ae9435b |
30255543305051 has 16 divisors (see below), whose sum is σ = 31831721358528. Its totient is φ = 28719310233600.
The previous prime is 30255543305021. The next prime is 30255543305089. The reversal of 30255543305051 is 15050334555203.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30255543305051 is a prime.
It is a super-2 number, since 2×302555433050512 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30255543305021) 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, 103117211 + ... + 103410203.
It is an arithmetic number, because the mean of its divisors is an integer number (1989482584908).
Almost surely, 230255543305051 is an apocalyptic number.
30255543305051 is a deficient number, since it is larger than the sum of its proper divisors (1576178053477).
30255543305051 is a wasteful number, since it uses less digits than its factorization.
30255543305051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361142.
The product of its (nonzero) digits is 675000, while the sum is 41.
The spelling of 30255543305051 in words is "thirty trillion, two hundred fifty-five billion, five hundred forty-three million, three hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •