Base | Representation |
---|---|
bin | 1101100111110001000… |
… | …0111000011000010010 |
3 | 211101000202210211121111 |
4 | 3121330100320120102 |
5 | 12313224314042002 |
6 | 255300515243534 |
7 | 22623026653306 |
oct | 3317420703022 |
9 | 741022724544 |
10 | 234013034002 |
11 | 90276291060 |
12 | 3942a5a95aa |
13 | 190b4c1a4b7 |
14 | b47d4b3d06 |
15 | 614954a3d7 |
hex | 367c438612 |
234013034002 has 8 divisors (see below), whose sum is σ = 382930419312. Its totient is φ = 106369560900.
The previous prime is 234013033963. The next prime is 234013034011. The reversal of 234013034002 is 200430310432.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 10636956091 = 234013034002 / (2 + 3 + 4 + 0 + 1 + 3 + 0 + 3 + 4 + 0 + 0 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5318478024 + ... + 5318478067.
It is an arithmetic number, because the mean of its divisors is an integer number (47866302414).
Almost surely, 2234013034002 is an apocalyptic number.
234013034002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
234013034002 is a deficient number, since it is larger than the sum of its proper divisors (148917385310).
234013034002 is a wasteful number, since it uses less digits than its factorization.
234013034002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10636956104.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 234013034002 its reverse (200430310432), we get a palindrome (434443344434).
The spelling of 234013034002 in words is "two hundred thirty-four billion, thirteen million, thirty-four thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •