Base | Representation |
---|---|
bin | 1110000101111100101… |
… | …1100011000110000101 |
3 | 212010221102010221200021 |
4 | 3201133023203012011 |
5 | 12431322422001204 |
6 | 303120501215141 |
7 | 23330556545125 |
oct | 3413713430605 |
9 | 763842127607 |
10 | 242115031429 |
11 | 937536946a7 |
12 | 3ab0ba014b1 |
13 | 19aa662330b |
14 | ba0b52cc85 |
15 | 6470992154 |
hex | 385f2e3185 |
242115031429 has 16 divisors (see below), whose sum is σ = 263658951360. Its totient is φ = 221562000000.
The previous prime is 242115031427. The next prime is 242115031447. The reversal of 242115031429 is 924130511242.
242115031429 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 242115031429 - 21 = 242115031427 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 242115031394 and 242115031403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242115031427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1459947 + ... + 1617304.
It is an arithmetic number, because the mean of its divisors is an integer number (16478684460).
Almost surely, 2242115031429 is an apocalyptic number.
It is an amenable number.
242115031429 is a deficient number, since it is larger than the sum of its proper divisors (21543919931).
242115031429 is a wasteful number, since it uses less digits than its factorization.
242115031429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3077412.
The product of its (nonzero) digits is 17280, while the sum is 34.
The spelling of 242115031429 in words is "two hundred forty-two billion, one hundred fifteen million, thirty-one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •