Base | Representation |
---|---|
bin | 101100100110000110010… |
… | …100111011000111101111 |
3 | 101211222011211022001201012 |
4 | 230212012110323013233 |
5 | 400202212210022111 |
6 | 10303501502135435 |
7 | 434256533241164 |
oct | 54460624730757 |
9 | 11758154261635 |
10 | 3064565314031 |
11 | a81747254841 |
12 | 415b2488157b |
13 | 192cab051530 |
14 | a847bc1806b |
15 | 54ab2b8748b |
hex | 2c98653b1ef |
3064565314031 has 16 divisors (see below), whose sum is σ = 3307221005760. Its totient is φ = 2822899411200.
The previous prime is 3064565313973. The next prime is 3064565314033. The reversal of 3064565314031 is 1304135654603.
It is a cyclic number.
It is not a de Polignac number, because 3064565314031 - 26 = 3064565313967 is a prime.
It is a super-2 number, since 2×30645653140312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3064565314031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3064565314033) 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, 79109075 + ... + 79147803.
It is an arithmetic number, because the mean of its divisors is an integer number (206701312860).
Almost surely, 23064565314031 is an apocalyptic number.
3064565314031 is a deficient number, since it is larger than the sum of its proper divisors (242655691729).
3064565314031 is a wasteful number, since it uses less digits than its factorization.
3064565314031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51346.
The product of its (nonzero) digits is 388800, while the sum is 41.
The spelling of 3064565314031 in words is "three trillion, sixty-four billion, five hundred sixty-five million, three hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •