Base | Representation |
---|---|
bin | 100000010111000111011011… |
… | …100101110010000101011101 |
3 | 200122221020022201120210021010 |
4 | 200113013123211302011131 |
5 | 122123332134420333313 |
6 | 1222411400245325433 |
7 | 41656500225011520 |
oct | 4027073345620535 |
9 | 618836281523233 |
10 | 142326015402333 |
11 | 41393140299134 |
12 | 13b6789a706879 |
13 | 61553937aa859 |
14 | 272088a062bb7 |
15 | 116c35da704c3 |
hex | 8171db97215d |
142326015402333 has 16 divisors (see below), whose sum is σ = 216877926070400. Its totient is φ = 81329081040576.
The previous prime is 142326015402313. The next prime is 142326015402341. The reversal of 142326015402333 is 333204510623241.
142326015402333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 142326015402333 - 29 = 142326015401821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142326015402291 and 142326015402300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142326015402313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30837291 + ... + 35150967.
It is an arithmetic number, because the mean of its divisors is an integer number (13554870379400).
Almost surely, 2142326015402333 is an apocalyptic number.
It is an amenable number.
142326015402333 is a deficient number, since it is larger than the sum of its proper divisors (74551910668067).
142326015402333 is a wasteful number, since it uses less digits than its factorization.
142326015402333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5884836.
The product of its (nonzero) digits is 311040, while the sum is 39.
The spelling of 142326015402333 in words is "one hundred forty-two trillion, three hundred twenty-six billion, fifteen million, four hundred two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •